import ContractExact namespace Submission open ExactRuntime FloatLib.Floats.Formats.BinaryInterchange FloatLib.Floats open ExactRuntime renaming idxOf->γ,mantOf->δ,Word->ο,signOf->φ,rationalWord->ψ,finishWord->Γ,expOf->Ξ,mantOf_lt_24->Ω,oneW->ϒ,toWord->ϗ,limbVal->ϟ,Fmt->Ϡ,sqrtLower->Ϣ,rowMean->Ϯ,sqrtAccuracy->ϴ,addLimbs64->Ϸ,limbValA->Ϲ,finishWord_scale->Ϻ,rowVariance->Ἅ,sqrtRational->ἥ,stableNormDomain->Ἣ,roundRational->ἰ,decodeD_toRat->ἱ,addLimbs64_size->ἷ,dotOf->Ἰ,limbValA_eq->ὃ,addLimbs64_eq->Ὀ,addLimbs_val->Ὑ,fracOf_toNat_lt->ὑ,expOf_toNat_lt->Ὗ,fracOf->ὥ,dallNZ->ὦ open UInt64 renaming lt_iff_toNat_lt->ε,le_iff_toNat_le->η,toNat_inj->θ,toNat_add->ι,toNat_sub_of_le->κ,toNat_shiftLeft->ω,toNat_lt_size->Β,toNat_shiftRight->Δ,toNat_zero->Κ,toNat_mul->Ϛ,toNat_div->ϛ,toNat_sub->ϧ,toNat_ofNat_of_lt'->Ϭ,toNat_mod->ϲ,toNat_toUInt32->ϻ,toNat_not->ἇ,toNat->Ἀ,size->ἶ,toNat_and->ὠ,add_assoc->ὡ,zero_shiftLeft->Ὦ,or_eq_zero_iff->Ὧ,toNat_ofNat'->ᾀ,reduceToNat->ᾆ open Nat renaming mod_eq_of_lt->ζ,pow_le_pow_right->ξ,shiftLeft_eq->π,shiftRight_eq_div_pow->ρ,two_pow_pos->χ,mul_le_mul_right->Α,mul_lt_mul_of_lt_of_le->Ε,pow_add->Ζ,mul_lt_mul_of_pos_right->Λ,mul_comm->Μ,pos_of_ne_zero->Ο,mod_lt->Ρ,div_lt_iff_lt_mul->Τ,and_two_pow_sub_one_eq_mod->Ψ,mul_assoc->ϋ,le_add_right->ό,div_div_eq_div_mul->ϐ,add_comm->ϑ,mul_pos->ϓ,lt_log2_self->ϔ,log2_self_le->ϕ,add_mul_mod_self_right->ϖ,log2_eq_iff->ϙ,le_div_iff_mul_le->ϝ,div_lt_of_lt_mul->ϡ,mod_le->Ϥ,mul_le_mul_left->ϥ,zero_add->Ϩ,log2_lt->ϩ,mul_lt_mul''->Ϫ,add_mul_div_right->ϭ,add_assoc->ϱ,div_eq_of_lt->϶,mul_eq_zero->ἁ,cast_sub->Ἂ,toUInt64_eq->Ἇ,div_add_mod->ἐ,lt_or_eq_of_le->ἑ,eq_zero_or_pos->ἒ,mul_le_mul->Ἓ,le_one_iff_eq_zero_or_eq_one->Ἔ,div_eq_zero_iff_lt->Ἕ,div_add_mod'->ἣ,shiftLeft_add_eq_or_of_lt->ἧ,mod_add_div->Ἠ,lt_succ_iff->Ἡ,pos_iff_ne_zero->Ἤ,add_lt_add_left->Ἥ,add_le_add_left->Ἦ,mul_zero->ἲ,lt_or_ge->ὄ,toUInt32_eq->Ὂ,pow_lt_pow_right->Ὃ,le_log2->Ὄ,add_mul->Ὅ,and_two_pow_sub_one_of_lt_two_pow->Ὕ,add_eq_zero_iff->ὒ,cast_zero->ὖ,add_zero->ὣ,add_mul_mod_self_left->Ὣ,zero_mul->ᾁ,one_le_iff_ne_zero->ᾂ,le_mul_of_pos_left->ᾃ,cast_mul->ᾄ open FloatLib.Numerics renaming roundQuotientEven->ν,shiftRightJam->Υ,roundShiftRightEven->Ϙ,or_one_eq->ϰ,roundShiftRightEven_shiftRightJam->ἕ,roundShiftRightEven_le_succ->ἢ open Array renaming ofFn->ς,replicate->Θ,mkEmpty->Ι,ext'->ἵ,emptyWithCapacity->Ἴ,getElem_push_lt->ὼ,getElem_push_eq->ώ open Model.NativeBinary32 renaming mkBits->σ,ofUInt32->ϫ,ofUInt32_mkBits->Ἧ,roundRatScaled->ἳ open Bool renaming false_eq_true->τ,and_eq_true->Ν,or_eq_false_iff->ϯ,eq_iff_iff->ἀ,not_eq_true'->Ἒ,xor->ὀ,or_eq_true->Ὁ,true_and->Ὥ open USize renaming lt_iff_toNat_lt->υ,size->Ϝ,toNat_lt_size->ϣ,le_size->Ϧ,toNat_one->ϸ open UInt32 renaming toNat_inj->Η,toNat_toUInt64->ϊ,toNat_lt_size->ώ,toNat_shiftRight->ϳ,lt_iff_toNat_lt->ἓ,toNat_ofNat'->ἦ,toNat_sub_of_le->Ἵ,le_iff_toNat_le->Ἶ,ofNat_toNat->Ὓ open List renaming range'->Φ,range'_succ->Ϟ,ext_getElem->ϵ,range->Ἁ,drop_of_length_le->ὂ,foldl_cons->ὅ,map_congr_left->ὐ,sum_cons->ὓ,map_cons->ὔ,mem_range'_1->ὢ,mem_range->Ὢ,sum_map_mul_right->ὶ,map_map->ί,range_eq_range'->ᾇ open Model renaming roundDyadicGeneral->Χ,roundDyadicGeneral_eq_roundDyadic->ύ,addDyadic->Ἆ,roundDyadic->Ἑ,pow2->ἠ,roundWithAccuracy_quotient_eq_finishRoundedMantissa->ἡ,packRoundedSubnormal->ἴ,ofModel->Ἱ,add->Ἳ,ofModel_finite_normalized_eq_ofFields->Ἷ,toNatBits->ὤ,finishRoundedMantissa->ὧ,zero->Ὠ,packRoundedNormal->Ὤ,ofBits->έ,nativeOverflow->ᾅ open Float.Model renaming totalExponent->Ϗ open FloatLib.Numerics.RationalBinary renaming lessThanPowerOfTwo->ἂ,scaleByPowerOfTwo->ἄ,atLeastPowerOfTwo->ἅ,floorLog2->Ἃ open Int renaming ofNat->ἃ,negSucc->ἔ,shiftLeft_eq->ὁ,toNat_of_nonneg->ὕ,natAbs_natCast->ὗ open FloatLib.Numerics.FixedWord renaming roundShiftRightEven_toNat->ἆ,roundShiftRightEven->Ἄ open Float.Model.UnpackedFloat renaming roundWithAccuracy->Ἐ,accuracyOfFraction->ὴ open Model.Reduction.Internal renaming dotStateLoop->ἤ,dotState->Ἢ,dotState_exact_toRat->ή open Float.Model.Format renaming targetExponent->Ἲ open FloatLib.Floats.Formats.Flocq renaming bpow->Ὡ open Model.Reduction.Semantics renaming finiteDot_toList_eq_slice->ὰ,finiteDotSlice->ά,finiteDot->ὲ open FloatLib.Numerics.Dyadic renaming toRat_eq_zero_iff->ὸ,add_toRat->ό,addFields->ὺ,add->ύ local notation"א"=>by omega local notation"ب"=>if_neg local notation"ة"=>if_pos local notation"ت"=>ite_false local notation"ث"=>ite_true local notation"ج"=>decide_eq_true_eq local notation"ح"=>getElem!_pos local notation"خ"=>beq_iff_eq local notation"د"=>zpow_natCast local notation"ذ"=>decide_eq_true_iff local notation"ر"=>decide_eq_false_iff_not local notation"ز"=>pow_add local notation"س"=>zero_add local notation"ص"=>congrArg local notation"ض"=>beq_self_eq_true local notation"ع"=>mul_assoc local notation"ו"=>UInt64 local notation"ז"=>UInt32 local postfix:max"ڇ"=>UInt64.toNat local postfix:max"ڇ"=>USize.toNat local postfix:max"ڇ"=>UInt32.toNat local postfix:max"ڇ"=>Int.toNat local postfix:max"ڈ"=>Nat.toUInt64 local postfix:max"ڈ"=>UInt32.toUInt64 local postfix:max"ڑ"=>Array.size local postfix:max"ڕ"=>Nat.log2 local postfix:max"ژ"=>Nat.toUSize local postfix:max"ڤ"=>Array.toList local postfix:max"ڨ"=>Nat.toUInt32 local postfix:max"ڨ"=>UInt64.toUInt32 local postfix:max"ک"=>Fin.val local postfix:max"ڭ"=>Int.natAbs local notation"ג"=>by simp local notation"ד"=>by decide local notation"ב"=>by norm_num local notation"ה"=>by positivity structure Acc where pos:Array Nat neg:Array Nat special:Bool negZero:Bool def Acc.empty:Acc:=⟨Θ 18 0,Θ 18 0,false,true⟩ def Acc.total (acc:Acc):Int:=(ϟ acc.posڤ:Int)-ϟ acc.negڤ @[inline] def Acc.add (acc:Acc) (m idx:Nat) (neg:Bool):Acc := match acc with | ⟨pos,ng,sp,nz⟩ => if m=0 then ⟨pos,ng,sp,nz&&neg⟩ else if neg then ⟨pos,Ϸ ng mڈ idx,sp,false⟩ else ⟨Ϸ pos mڈ 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 (acc:Acc) (m idx:Nat) (neg:Bool) (hp:acc.posڑ=18) (hn:acc.negڑ=18) (hm:m<2^64) (hi:idx/32+1<18) : (acc.add m idx neg).posڑ=18/\(acc.add m idx neg).negڑ=18 /\ (acc.add m idx neg).special=acc.special /\ (acc.add m idx neg).negZero=(acc.negZero&&(decide (m=0)&&neg)) /\ (acc.add m idx neg).total=acc.total+(if neg then -(m:Int) else m)*2^idx:=by obtain ⟨pos,ng,sp,nz⟩:=acc;simp only at hp hn;by_cases h0:m=0 . simp [Acc.add,Acc.total,h0,hp,hn] . cases neg . refine ⟨by simp [Acc.add,h0,ἷ,hp],by simp [Acc.add,h0,hn],by simp [Acc.add,h0],by simp [Acc.add,h0],?_⟩ simp only [Acc.add,h0,ت,τ,Ὀ _ _ _ hm,Acc.total];rw [Ὑ _ _ _ א];push_cast;ring . refine ⟨by simp [Acc.add,h0,hp],by simp [Acc.add,h0,ἷ,hn],by simp [Acc.add,h0],by simp [Acc.add,h0],?_⟩ simp only [Acc.add,h0,ت,ث,Ὀ _ _ _ hm,Acc.total];rw [Ὑ _ _ _ א];push_cast;ring lemma Acc.total_empty:Acc.empty.total=0:=ד section open FloatLib.Numerics lemma ZbF (s:Bool) (m:Nat) (e:Int) (j:Nat) (h:j+25<= mڕ):Ἑ Ϡ ⟨s,shiftRightJam m j,e+j⟩=Ἑ Ϡ ⟨s,m,e⟩:=by have h7:m≠0:=by rintro rfl;simp at h have h9:2^mڕ<= m:=ϕ h7 have hm:2^(j+1)<= m:=le_trans (ξ ב א) h9 have h0:(shiftRightJam m j)ڕ=mڕ-j:=log2_shiftRightJam m j hm have hc:shiftRightJam m j≠0:=shiftRightJam_ne_zero m j (le_trans (ξ ב א) hm) rw [<- ύ,<- ύ] unfold Χ simp only [خ,ت,h0] have hd:((mڕ-j:Nat):Int)+(e+j)=(mڕ:Int)+e:=א have h8:Ϡ.fracWidth=23:=rfl have h6:Ϡ.minSubnormalExponent=-149:=rfl have h5:Ϡ.minNormalExponent=-126:=rfl rw [h8,h6,h5] split_ifs with h1 h2 h3 h4 <;> try omega . rfl . congr 1 obtain ⟨a,ha⟩:∃ a:Nat,e - -149=ἔ a:=⟨(-(e+149)-1).toNat,by omega⟩ have hb:e+j - -149=ἔ (a-j):=א rw [ha,hb] dsimp only rw [show a-j+1=(a+1)-j by omega] exact roundShiftRightEven_shiftRightJam m j (a+1) א . congr 1;rw [show mڕ-j-23=(mڕ-23)-j by omega];exact roundShiftRightEven_shiftRightJam m j _ א def Yg (a:Array Nat) (i:Nat):Nat-> Nat | 0=>0 | k+1=>a[i]!+2^32*Yg a (i+1) k lemma Zv (a:Array Nat) (i k m:Nat):Yg a i (k+m)=Yg a i k+2^(32*k)*Yg a (i+k) m:=by induction k generalizing i with | zero=>simp [Yg] | succ k ih => rw [show k+1+m=(k+m)+1 by omega,Yg,Yg,ih,show i+1+k=i+(k+1) by omega];ring lemma ZbG (a b:Array Nat) (i j k:Nat) (h:∀ t,t< k-> 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 ih => rw [Yg,Yg,ih (i+1) (j+1) (λ t ht=>by rw [show i+1+t=i+(t+1) by omega,show j+1+t=j+(t+1) by omega];exact h (t+1) א),show a[i]! =b[j]! from by simpa using h 0 א] lemma Zw (a:Array Nat) (i k:Nat):Yg a i k=0 ↔ ∀ t,t< k-> a[i+t]! =0:=by induction k generalizing i with | zero=>simp [Yg] | succ k ih => rw [Yg,ὒ,ἁ,ih (i+1)] have hp:(2:ℕ)^32≠0:=ג constructor . rintro ⟨h0,h1 | h1⟩ t ht . exact absurd h1 hp . rcases t with _ | t . simpa using h0 . rw [show i+(t+1)=i+1+t by omega];exact h1 t א . intro h refine ⟨by simpa using h 0 א,Or.inr λ t ht => ?_⟩ rw [show i+1+t=i+(t+1) by omega];exact h (t+1) א lemma ZbH (a:Array Nat) (i k:Nat) (h:∀ t,t< k-> a[i+t]!<2^32):Yg a i k<2^(32*k):=by induction k generalizing i with | zero=>simp [Yg] | succ k ih => have h0:=h 0 א;have h1:=ih (i+1) (λ t ht=>by rw [show i+1+t=i+(t+1) by omega];exact h (t+1) א) simp at h0;rw [Yg,show 32*(k+1)=32+32*k by ring,ز];nlinarith lemma Zav (a:Array Nat) (t:Nat) (h:aڑ<= t):a[t]! =0:=by simp_all lemma ZbI (a:Array Nat) (i k:Nat) (h:aڑ<= i+k):Yg a i k=ϟ (a.toList.drop i):=by induction k generalizing i with | zero=>simp [Yg,ὂ (by simpa using h:a.toList.length<= i),ϟ] | succ k ih => rw [Yg,ih (i+1) א];by_cases hi:i< aڑ . have hl:i< a.toList.length:=א simp only [List.drop_eq_getElem_cons hl,ϟ,ح a i hi,Array.getElem_toList] . rw [Zav a i א,ὂ (by simp;omega),ὂ (by simp;omega)] simp [ϟ] lemma ZbJ (a:Array Nat) (lo n:Nat) (h0:∀ t,t< lo-> a[t]! =0) (h1:∀ t,lo+n<= t-> a[t]! =0) : ϟ aڤ=2^(32*lo)*Yg a lo n:=by rw [<- List.drop_zero (l:=aڤ),<- ZbI a 0 (lo+(n+aڑ)) א,Zv,Zv] rw [(Zw a 0 lo).2 (λ t ht=>by simpa using h0 t ht),(Zw a (0+lo+n) aڑ).2 (λ t _=>h1 _ א)] simp def YP (a b:Array Nat) (i ca cb br:Nat) (out:Array Nat) : Nat-> Array Nat × Nat × Nat × Nat | 0=>(out,ca,cb,br) | k+1 => let ta:=a[i]!+ca let tb:=b[i]!+cb let t:=ta%4294967296+4294967296-tb%4294967296-br YP a b (i+1) (ta/4294967296) (tb/4294967296) (1-t/4294967296) (out.push (t%4294967296)) k lemma Zaw (a b:Array Nat) (i ca cb br:Nat) (out:Array Nat) (k:Nat) (ha:br<=1) (h0:∀ t,t< outڑ-> out[t]!<2^32) : let r:=YP a b i ca cb br out k r.1.size=outڑ+k/\(∀ t,t< r.1.size-> r.1[t]!<2^32) /\ (Yg r.1 0 r.1.size:Int)+2^(32*(outڑ+k))*(r.2.1-r.2.2.1-r.2.2.2:Int)=Yg out 0 outڑ+2^(32*outڑ)*((Yg a i k:Int)-Yg b i k+ca-cb-br):=by induction k generalizing i ca cb br out with | zero=>exact ⟨by simp [YP],by simpa [YP] using h0,by simp [YP,Yg]⟩ | succ k ih => simp only [YP] set ta:=a[i]!+ca set tb:=b[i]!+cb set t:=ta%4294967296+4294967296-tb%4294967296-br have h9:tb%4294967296<4294967296:=Ρ _ ב have h7:ta%4294967296<4294967296:=Ρ _ ב have h8:t<2*4294967296:=א have hq:t/4294967296<=1:=א have hd:t%4294967296<2^32:=א have h5:∀ s,s<(out.push (t%4294967296))ڑ-> (out.push (t%4294967296))[s]!<2^32:=by intro s hs simp only [Array.size_push] at hs rcases ἑ (Ἡ.mp hs) with hs | rfl . rw [ح _ s (by simp;omega),ὼ hs,<- ح out s hs];exact h0 s hs . rw [ح _ _ ג,ώ];exact hd obtain ⟨h1,h2,h3⟩:=ih (i+1) (ta/4294967296) (tb/4294967296) (1-t/4294967296) (out.push (t%4294967296)) א h5 refine ⟨by simp [h1];omega,h2,?_⟩;have h4:Yg (out.push (t%4294967296)) 0 (outڑ+1)=Yg out 0 outڑ+2^(32*outڑ)*(t%4294967296):=by rw [Zv,ZbG _ out 0 0 outڑ (λ s hs=>by rw [ح _ _ (by simp;omega),ὼ א,<- ح out _ א])] simp only [Yg,Ϩ,ἲ,ὣ];rw [ح _ _ ג,ώ] simp only [Array.size_push] at h3 ⊢;rw [show outڑ+(k+1)=outڑ+1+k by omega];rw [h3,h4,Yg,Yg];have h6:((t%4294967296:Nat):Int)+4294967296*((ta/4294967296:Nat)-(tb/4294967296:Nat)-(1-t/4294967296:Nat))=(a[i]!:Int)-b[i]!+ca-cb-br:=by have e1:=Ἠ ta 4294967296 have e2:=Ἠ tb 4294967296 have e3:=Ἠ t 4294967296 have e4:(1-t/4294967296:Nat)=1-(t/4294967296:Int):=א have e5:(t:Int)=ta%4294967296+4294967296-tb%4294967296-br:=א push_cast [e4] omega rw [show 32*(outڑ+1)=32*outڑ+32 by ring,ز];simp only [Nat.cast_add,ᾄ,Nat.cast_pow,Nat.cast_ofNat];linear_combination (2:Int)^(32*outڑ)*h6 def YW (r:Array Nat):Nat-> Option Nat | 0=>none | k+1=>if r[k]! != 0 then some k else YW r k def YX (r:Array Nat):Nat-> Bool | 0=>false | k+1=>r[k]! != 0||YX r k lemma ZbK (r:Array Nat) (k:Nat) (h:YW r k=none):∀ t,t< k-> r[t]! =0:=by induction k with | zero=>intro t ht;omega | succ k ih => simp only [YW] at h;split at h . cases h . rename_i hk;intro t ht;rcases ἑ (Ἡ.mp ht) with ht | rfl . exact ih h t ht . simpa using hk lemma Zax (r:Array Nat) (k h:Nat) (hh:YW r k=some h):h< k/\r[h]!≠0 /\ ∀ t,h< t-> t< k-> r[t]! =0:=by induction k with | zero=>simp [YW] at hh | succ k ih => simp only [YW] at hh;split at hh . rename_i hk;cases hh;exact ⟨by omega,by simpa using hk,λ t h1 h2=>א⟩ . rename_i hk;obtain ⟨a,b,c⟩:=ih hh;refine ⟨by omega,b,λ t h1 h2 => ?_⟩;rcases ἑ (Ἡ.mp h2) with h2 | rfl . exact c t h1 h2 . simpa using hk lemma Zay (r:Array Nat) (k:Nat):YX r k=false ↔ ∀ t,t< k-> r[t]! =0:=by induction k with | zero=>simp [YX] | succ k ih => simp only [YX,ϯ,bne_eq_false_iff_eq,ih];constructor . rintro ⟨h0,h1⟩ t ht;rcases ἑ (Ἡ.mp ht) with ht | rfl . exact h1 t ht . exact h0 . intro h;exact ⟨h k א,λ t ht=>h t א⟩ lemma ZbL (r:Array Nat) (k:Nat):YX r k=(Yg r 0 k != 0):=by have hz:=Zw r 0 k;simp at hz;cases h:YX r k . rw [hz.2 ((Zay r k).1 h)];rfl . have:Yg r 0 k≠0:=λ h0=>by have:=(Zay r k).2 (hz.1 h0);simp_all simp [this] lemma ZbM (low x y h:Nat) (h6:low<2^(32*h)):shiftRightJam (low+2^(32*h)*(x+2^32*y)) (32*h+2)=if x%4 != 0||low != 0 then (y*1073741824+x/4)|||1 else y*1073741824+x/4:=by have h5:2^(32*h+2)=4*2^(32*h):=by grind have hs:x%4<4:=Ρ x ב have hA:low+2^(32*h)*(x%4)<4*2^(32*h):=by nlinarith have h3:low+2^(32*h)*(x+2^32*y)=(low+2^(32*h)*(x%4))+4*2^(32*h)*(y*1073741824+x/4):=by have h4:=Ἠ x 4 rw [show (2:Nat)^32=4*1073741824 by norm_num] conv_lhs=>rw [<- h4] ring have hz:low+2^(32*h)*(x%4)=0 ↔ ¬(x%4≠0\/low≠0):=by constructor . intro h0;have h1:=Nat.eq_zero_of_add_eq_zero h0;rcases ἁ.mp h1.2 with h2 | h2 <;> omega . intro h0;simp at h0;simp [h0.1,h0.2] unfold shiftRightJam;dsimp only;rw [h5,h3,Nat.add_mul_div_left _ _ א,϶ hA,Ϩ,Ὣ,ζ hA] by_cases hc:x%4≠0\/low≠0 . have:¬ (low+2^(32*h)*(x%4)=0):=λ h0=>hz.mp h0 hc have hb:(x%4 != 0||low != 0)=true:=by grind simp only [خ,this,ت,hb,ث] . have:low+2^(32*h)*(x%4)=0:=hz.mpr hc have hb:(x%4 != 0||low != 0)=false:=by grind simp only [خ,this,ث,hb] rfl def Yas (neg:Bool) (r:Array Nat) (e:Int) (negZero:Bool):ז := match YW r rڑ with | none=>Γ 0 e negZero | some 0=>Γ (if neg then -(r[0]!:Int) 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 ϗ (Ἑ Ϡ ⟨neg,m,e+((32*h+2:Nat):Int)⟩) lemma ZbN (neg:Bool) (R:Nat) (e:Int) (negZero:Bool) (hR:R≠0):Γ (if neg then -(R:Int) else R) e negZero=ϗ (Ἑ Ϡ ⟨neg,R,e⟩):=by have h0:(0:Int)< R:=א cases neg <;> simp [Γ,ofIntDyadic,hR,not_lt.mpr h0.le,Ο hR] lemma Zaz (neg:Bool) (r:Array Nat) (e:Int) (negZero:Bool) (hr:∀ t,t< rڑ-> r[t]!<2^32) : Yas neg r e negZero=Γ (if neg then -(Yg r 0 rڑ:Int) else Yg r 0 rڑ) e negZero:=by unfold Yas;split . rename_i h7;rw [(Zw r 0 rڑ).2 (λ t ht=>by simpa using ZbK r _ h7 t ht)];simp . rename_i h0;obtain ⟨h1,h2,h3⟩:=Zax r _ 0 h0;rw [show rڑ=1+(rڑ-1) by omega,Zv,(Zw r (0+1) (rڑ-1)).2 (λ t ht=>h3 _ א א)] simp [Yg] . rename_i h h0;obtain ⟨h1,h2,h3⟩:=Zax r _ (h+1) h0;have hR:Yg r 0 rڑ=Yg r 0 h+2^(32*h)*(r[h]!+2^32*r[h+1]!):=by rw [show rڑ=h+(2+(rڑ-h-2)) by omega,Zv,Zv,(Zw r (0+h+2) _).2 (λ t ht=>h3 _ א א)] simp [Yg] have h5:Yg r 0 h<2^(32*h):=ZbH r 0 h (λ t ht=>hr _ א);have h4:Yg r 0 rڑ≠0:=by rw [hR];have:0<2^(32*h)*(r[h]!+2^32*r[h+1]!):=by have:=Ο h2;positivity omega have h6:32*h+2+25<=(Yg r 0 rڑ)ڕ:=by rw [Ὄ h4,hR];have:1<= r[h+1]!:= Ο h2 calc 2^(32*h+2+25)<=2^(32*h)*2^32:=by rw [<- ز];exact ξ ב א _<=2^(32*h)*(r[h]!+2^32*r[h+1]!):=by gcongr;nlinarith _<= _:=א rw [ZbN neg _ e negZero h4,<- ZbF neg _ e _ h6,hR,ZbM _ _ _ h h5,ZbL] def Yab (pos neg:Array Nat):Nat-> Nat | 0=>0 | k+1=>if pos[k]! != 0||neg[k]! != 0 then k+1 else Yab pos neg k lemma ZbO (pos neg:Array Nat) (k:Nat):∀ t,Yab pos neg k<= t-> t< k-> pos[t]! =0/\neg[t]! =0:=by induction k with | zero=>intro t _ ht;omega | succ k ih => intro t h1 h2;simp only [Yab] at h1;split at h1 . omega . rename_i hk;rcases ἑ (Ἡ.mp h2) with h2 | rfl . exact ih t h1 h2 . simpa [Ὁ,bne_iff_ne,not_or] using hk def YaL (pos neg:Array Nat) (e:Int) (negZero:Bool):ז := let lo:=lowLimb pos neg posڑ 0 let n:=Yab pos neg (max posڑ negڑ)+1-lo let e':=e+((32*lo:Nat):Int) let d:=YP pos neg lo 0 0 0 (Ἴ 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 (Ἴ 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 ZaA (pos neg:Array Nat) (e:Int) (negZero:Bool):YaL pos neg e negZero=Γ ((ϟ posڤ:Int)-ϟ negڤ) e negZero:=by unfold YaL;dsimp only;set lo:=lowLimb pos neg posڑ 0;set n:=Yab pos neg (max posڑ negڑ)+1-lo;have h3:=lowLimb_zero pos neg posڑ 0;have h4:=ZbO pos neg (max posڑ negڑ);have h5 (a:Array Nat) (ha:a=pos\/a=neg):ϟ aڤ=2^(32*lo)*Yg a lo n:=by apply ZbJ a lo n . intro t ht;rcases ha with rfl | rfl . exact (h3 t א ht).1 . exact (h3 t א ht).2 . intro t ht;by_cases h6:t< max posڑ negڑ . rcases ha with rfl | rfl . exact (h4 t א h6).1 . exact (h4 t א h6).2 . rcases ha with rfl | rfl <;> exact Zav _ t א have hP:=h5 pos (Or.inl rfl);have hN:=h5 neg (Or.inr rfl);rw [show (Ἴ n:Array Nat)=#[] from rfl];have hd:=Zaw pos neg lo 0 0 0 #[] n א ג;have h7:=Zaw neg pos lo 0 0 0 #[] n א ג;have h9:Yg (#[]:Array Nat) 0 0=0:=rfl;simp only [List.size_toArray,List.length_nil,ἲ,pow_zero,one_mul,h9,ὖ,س] at hd h7 obtain ⟨-,hb,hv⟩:=hd;obtain ⟨-,h8,h0⟩:=h7;split_ifs with h1 h2 . rw [Zaz false _ _ _ hb,Ϻ,hP,hN];simp;congr 1;rw [h1.1,h1.2.1,h1.2.2] at hv;push_cast at hv ⊢;linear_combination (2:Int)^(32*lo)*hv . rw [Zaz true _ _ _ h8,Ϻ,hP,hN];simp;congr 1;rw [h2.1,h2.2.1,h2.2.2] at h0;push_cast at h0 ⊢;linear_combination (-(2:Int)^(32*lo))*h0 . exact finishLimbs_eq pos neg e negZero 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:Nat-> ז) (pos neg:Array Nat) (sp nz:Bool) (index:Nat):Nat-> 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:Nat) (fa fb:Nat-> ז):ז := let acc:=Yw fa fb (Θ 18 0) (Θ 18 0) false true 0 n if acc.special then dotSpec (ς (n:=n) λ i=>fa i) (ς (n:=n) λ i=>fb i) else YaL acc.pos acc.neg (-298) (n≠0&&acc.negZero) lemma Zn (wa wb:ז):(if ὀ (φ wa) (φ wb) then -((δ wa*δ wb:Nat):Int) else ((δ wa*δ wb:Nat):Int))=sv wa*sv wb:=by unfold sv;cases φ wa <;> cases φ wb <;> simp lemma ZbP (fa fb:Nat-> ז) (pos neg:Array Nat) (nz:Bool) (index count:Nat):(Yw fa fb pos neg true nz index count).special=true:=by induction count generalizing pos neg nz index with | zero=>rfl | succ count ih => rw [Yw];have hs:(Yy ⟨pos,neg,true,nz⟩ (fa index) (fb index)).special=true:=by unfold Yy Acc.markSpecial Acc.add;split_ifs <;> rfl generalize Yy ⟨pos,neg,true,nz⟩ (fa index) (fb index)=r at hs ⊢;obtain ⟨p,q,s,z⟩:=r;simp only at hs;subst hs;exact ih .. lemma ZaB (fa fb:Nat-> ז) (A B:Array ז) (n:Nat) (hA:∀ k,k< n-> A[k]! =fa k) (hB:∀ k,k< n-> B[k]! =fb k) (acc:Acc) (index remaining:Nat) (h:index+remaining<= n) (hp:acc.posڑ=18) (hn:acc.negڑ=18) (h0:(Yw fa fb acc.pos acc.neg acc.special acc.negZero index remaining).special =false) : acc.special=false /\ (∀ k,index<= k-> k< index+remaining-> Ξ A[k]!≠255/\Ξ B[k]!≠255) /\ (Yw fa fb acc.pos acc.neg acc.special acc.negZero index remaining).total=acc.total+dsum A B index remaining /\ (Yw fa fb acc.pos acc.neg acc.special acc.negZero index remaining).negZero=(acc.negZero&&ὦ A B index remaining):=by induction remaining generalizing acc index with | zero=>obtain ⟨p,n,s,z⟩:=acc;simp_all [Yw,dsum,ὦ] | succ count ih => obtain ⟨p,q,s,z⟩:=acc;simp only at hp hn;have ha:=hA index א;have hb:=hB index א;by_cases he:Ξ (fa index)=255\/Ξ (fb index)=255 . exfalso;rw [Yw] at h0;have hs:(Yy ⟨p,q,s,z⟩ (fa index) (fb index)).special=true:=by simp [Yy,he,Acc.markSpecial] generalize Yy ⟨p,q,s,z⟩ (fa index) (fb index)=r at hs h0;obtain ⟨p',q',s',z'⟩:=r;simp only at hs;subst hs;rw [ZbP] at h0;exact Bool.noConfusion h0 . have h6:=not_or.mp he obtain ⟨h1,h2,h3,h4,h5⟩:=Acc.add_spec ⟨p,q,s,z⟩ (δ (fa index)*δ (fb index)) (γ (fa index)+γ (fb index)) (ὀ (φ (fa index)) (φ (fb index))) hp hn (mul_mant_lt _ _) (by have:=idxOf_le _ h6.1;have:=idxOf_le _ h6.2;omega) have h7:Yy ⟨p,q,s,z⟩ (fa index) (fb index)=Acc.add ⟨p,q,s,z⟩ (δ (fa index)*δ (fb index)) (γ (fa index)+γ (fb index)) (ὀ (φ (fa index)) (φ (fb index))):=by simp [Yy,he] rw [Yw,h7] at h0 ⊢;obtain ⟨hs,h8,hD,hz⟩:=ih _ (index+1) א h1 h2 h0;refine ⟨by rw [<- h3,hs],?_,?_,?_⟩ . intro k k1 k2;rcases ὄ k (index+1) with hk | hk . have:k=index:=א subst this;rw [ha,hb];exact h6 . exact h8 k hk א . rw [hD,h5,dsum,ha,hb,Zn];ring . rw [hz,h4,ὦ,ha,hb];simp [Bool.and_assoc] lemma Ze (n:Nat) (f:Nat-> ז) (k:Nat) (hk:k< n):(ς (n:=n) λ i=>f iک)[k]! =f k:=by simp_all lemma Z5 (n:Nat) (fa fb:Nat-> ז):Yn n fa fb=dotSpec (ς (n:=n) λ i=>fa i) (ς (n:=n) λ i=>fb i):=by unfold Yn;set A:=ς (n:=n) λ i=>fa i with hA;set B:=ς (n:=n) λ i=>fb i with hB;set acc:=Yw fa fb (Θ 18 0) (Θ 18 0) false true 0 n with hj;by_cases hh:acc.special=true . simp [hh] . have h9:acc.special=false:=by grind obtain ⟨-,h3,hD,hz⟩:=ZaB fa fb A B n (Ze n fa) (Ze n fb) Acc.empty 0 n א (by simp [Acc.empty]) (by simp [Acc.empty]) h9 have hD:acc.total=dsum A B 0 n:=by have:=hD;simp only [Acc.total_empty,Int.zero_add] at this;exact this have hz:acc.negZero=ὦ A B 0 n:=by have:=hz;simp only [Acc.empty,Ὥ] at this;exact this simp only [h9,τ,ت];rw [ZaA,show ((ϟ acc.posڤ:Int)-ϟ acc.negڤ)=acc.total from rfl] have hc:Aڑ=n:=by simp [hA] have ha:Bڑ=n:=by simp [hB] set L:=A.map (Model.ofUInt32 (fmt:=Ϡ)) with hL set R:=B.map (Model.ofUInt32 (fmt:=Ϡ)) with hR have h0:Lڑ=Rڑ:=by grind have hd:Lڑ=n:=by grind have h5:∀ k (hk:k< Lڑ),Model.isFinite L[k]=true:=by intro k hk have h6:k< Aڑ:=א have:=(h3 k א א).1 rw [ح A k h6] at this simp [hL,isFinite_ofUInt32,this] have h8:∀ k (hk:k< Rڑ),Model.isFinite R[k]=true:=by intro k hk have h6:k< Bڑ:=א have:=(h3 k א א).2 rw [ح B k h6] at this simp [hR,isFinite_ofUInt32,this] have h7:ά L R 0 Lڑ ג (by simp [h0])=(acc.total:ℚ)*2^(-298:ℤ):=by have:=finiteDotSlice_eq A B 0 Lڑ (by simp [hL]) (by simp [hL,hc,ha]) (by intro k k1 k2;exact h3 k k1 א) exact this.trans (by rw [hd,hD]) have hb:=ή (destination:=Ϡ) L R h0 h5 h8 unfold dotSpec Model.dot;by_cases h4:acc.total=0 . have hf:(Ἢ L R h0:Model.Reduction.Internal.State Ϡ).exact.significand=0:=by rw [<- ὸ,hb,h7,h4];simp rw [Model.Reduction.dotWithStatus_eq_zero_of_finite Ϡ L R .nearestEven h0 h5 h8 hf,h4,finishWord_zero] unfold Ἢ;obtain ⟨h1,h2⟩:=dotStateLoop_flags A B {} 0 Lڑ (by simp [hL]) (by simp [hL,hc,ha]) (by intro k k1 k2;exact h3 k k1 א) have hg:(ἤ L R ({}:Model.Reduction.Internal.State Ϡ) 0 Lڑ ג (by simp [h0])).sawFiniteTerm=decide (Lڑ≠0):=by rw [show decide (Lڑ≠0)=(false||decide (Lڑ≠0)) by simp];exact h1 have he:(ἤ L R ({}:Model.Reduction.Internal.State Ϡ) 0 Lڑ ג (by simp [h0])).allTermsNegativeZero=ὦ A B 0 Lڑ:=by rw [show ὦ A B 0 Lڑ=(true&&ὦ A B 0 Lڑ) by simp];exact h2 simp only [Except.map,hg,he];rw [hz];simp [hd] . have hi:ὲ Lڤ Rڤ≠.ok 0:=by rw [ὰ L R h0];intro h;injection h with h;rw [h7] at h;simp at h;exact h4 h rw [Model.Reduction.dotWithStatus_eq_round_of_finite_nonzero Ϡ L R .nearestEven h0 h5 h8 hi] simp;exact finishWord_of_ne _ _ _ _ h4 (by rw [hb,h7]) lemma Zi:Yn=Ἰ:=funext λ n=>funext λ fa=>funext λ fb=>Z5 n fa fb def Yo (fa fb:Nat-> ז) (i:Nat):Nat-> Int | 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:Nat-> ז) (i:Nat):Nat-> Bool | 0=>true | r+1=>(decide (δ (fa i)*δ (fb i)=0)&&ὀ (φ (fa i)) (φ (fb i))) && Yq fa fb (i+1) r lemma Zb0 (n:Nat) (fa fb:Nat-> ז) (i r:Nat) (h:i+r<= n):dsum (ς (n:=n) λ k=>fa kک) (ς (n:=n) λ k=>fb kک) i r=Yo fa fb i r:=by induction r generalizing i with | zero=>rfl | succ r ih => rw [dsum,Yo,Ze n fa i א,Ze n fb i א,ih (i+1) א] lemma Zb1 (n:Nat) (fa fb:Nat-> ז) (i r:Nat) (h:i+r<= n):ὦ (ς (n:=n) λ k=>fa kک) (ς (n:=n) λ k=>fb kک) i r=Yq fa fb i r:=by induction r generalizing i with | zero=>rfl | succ r ih => rw [ὦ,Yq,Ze n fa i א,Ze n fb i א,ih (i+1) א] lemma Zb2 (fa fb:Nat-> ז) (pos neg:Array Nat) (nz:Bool) (index remaining:Nat) (h0:∀ k,index<= k-> k< index+remaining-> Ξ (fa k)≠255/\Ξ (fb k)≠255) : (Yw fa fb pos neg false nz index remaining).special=false:=by induction remaining generalizing pos neg nz index with | zero=>rfl | succ count ih => rw [Yw];have hf:=h0 index le_rfl א;have hs:(Yy ⟨pos,neg,false,nz⟩ (fa index) (fb index)).special=false:=by have hc:¬(Ξ (fa index)=255\/Ξ (fb index)=255):=by rintro (h | h) . exact hf.1 h . exact hf.2 h unfold Yy;unfold Acc.add;split_ifs <;> rfl generalize Yy ⟨pos,neg,false,nz⟩ (fa index) (fb index)=r at hs ⊢;obtain ⟨p,q,s,z⟩:=r;simp only at hs;subst hs;exact ih _ _ _ _ (λ k h1 h2=>h0 k א א) lemma Zy (n:Nat) (fa fb:Nat-> ז) (h1:∀ k,k< n-> Ξ (fa k)≠255/\Ξ (fb k)≠255) : Ἰ n fa fb=Γ (Yo fa fb 0 n) (-298) (decide (n≠0)&&Yq fa fb 0 n):=by rw [<- Zi];unfold Yn;set A:=ς (n:=n) λ i=>fa iک with hA;set B:=ς (n:=n) λ i=>fb iک with hB;set acc:=Yw fa fb (Θ 18 0) (Θ 18 0) false true 0 n with h5;have h0:acc.special=false:=Zb2 fa fb _ _ true 0 n (λ k _ h2=>h1 k א) obtain ⟨-,-,hD,hz⟩:=ZaB fa fb A B n (Ze n fa) (Ze n fb) Acc.empty 0 n א (by simp [Acc.empty]) (by simp [Acc.empty]) h0 have h4:acc.total=Yo fa fb 0 n:=by have:=hD;simp only [Acc.total_empty,Int.zero_add] at this;rw [<- Zb0 n fa fb 0 n א];exact this have h3:acc.negZero=Yq fa fb 0 n:=by have:=hz;simp only [Acc.empty] at this;rw [<- Zb1 n fa fb 0 n א];exact this simp only [h0,τ,ت];rw [ZaA,show ((ϟ acc.posڤ:Int)-ϟ acc.negڤ)=acc.total from rfl,h4,h3] def YC (w2 w1 w0:ו):Int := ((w2ڇ*2^128+w1ڇ*2^64+w0ڇ:Nat):Int) - (if w2ڇ<2^63 then 0 else 2^192) def Ym (w:ו):Int:=(wڇ:Int)-(if wڇ<2^63 then 0 else 2^64) lemma Zb3 (s:Bool) (E F:Nat) (hE:E<256) (hF:F<2^23):(Model.ofFields Ϡ 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,έ,ὤ,BitVec.toNat_ofNatLT] have h1:E&&&Ϡ.expAllOnesNat=E:=Ὕ (n:=8) hE have h2:F&&&Ϡ.fracMaskNat=F:=Ὕ (n:=23) hF rw [h1,h2,show E.shiftLeft Ϡ.fracWidth=E<<<23 from rfl,Nat.or_assoc,<- ἧ hF] have hb:E<<<23+F<2^31:=א cases s . simp [π] . simp only [ث] rw [show Nat.shiftLeft 1 (Ϡ.expWidth+Ϡ.fracWidth)=1<<<31 from rfl,<- ἧ hb] simp;omega @[inline] def Yv (neg:Bool) (E F:ז):ז:=(if neg then (0x80000000:ז) else 0)+(E<<<23)+F lemma ZT (neg:Bool) (E F:ז) (hE:Eڇ<256) (hF:Fڇ<2^23):Yv neg E F=ϗ (Model.ofFields Ϡ neg Eڇ Fڇ):=by unfold ϗ;rw [Zb3 neg _ _ hE hF];apply Η.mp;unfold Yv;cases neg <;> simp <;> omega lemma ZaG (neg:Bool):Yv neg 255 0=ϗ (ᾅ Ϡ neg):=by rw [Model.nativeOverflow_eq_signedInf_of_isIEEE Ϡ ד];cases neg <;> decide lemma Zb4 (neg:Bool):Yv neg 0 0=ϗ (Ὠ Ϡ neg):=by cases neg <;> 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:Nat) (hD:dڇ=D) (hd:1<= D) (hr:rڇ+2*D<=64) (h1:2^rڇ<= xڇ) (h2: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 hD have h3:(r+d)ڇ=rڇ+dڇ:=by rw [ι];omega have hs:(x>>>(r+d))ڇ=xڇ/2^(rڇ+dڇ):=by rw [Δ,h3,ζ א,ρ] unfold YH;by_cases hc:x>>>(r+d) != 0 . simp only [hc,ث,h3];have:xڇ/2^(rڇ+dڇ)≠0:=by intro h;apply (bne_iff_ne.mp hc);apply θ.mp;rw [hs,h];rfl refine ⟨by omega,?_,by rw [show rڇ+dڇ+dڇ=rڇ+2*dڇ by omega];exact h2⟩;exact (ϝ (χ _)).mp (ᾂ.mpr this) |>.trans' ג . simp only [hc,ت,τ] have h0:x>>>(r+d)=0:=by grind have:xڇ/2^(rڇ+dڇ)=0:=by rw [<- hs,h0];rfl refine ⟨by omega,h1,?_⟩ exact (Ἕ (χ _)).mp this lemma Zj (x:ו) (hx:x≠0):(Yj x)ڇ=x.toNatڕ:=by have h0:1<= xڇ:=ᾂ.mpr λ h=>hx (θ.mp (by simpa using h));have h1:=x.toNat_lt;obtain ⟨a1,b1,c1⟩:=Zz x 0 32 32 rfl ד ד (by simpa using h0) (by simpa using h1);obtain ⟨a2,b2,c2⟩:=Zz x _ 16 16 rfl ד א b1 (by simpa using c1);obtain ⟨a3,b3,c3⟩:=Zz x _ 8 8 rfl ד א b2 (by simpa using c2);obtain ⟨a4,b4,c4⟩:=Zz x _ 4 4 rfl ד א b3 (by simpa using c3);obtain ⟨a5,b5,c5⟩:=Zz x _ 2 2 rfl ד א b4 (by simpa using c4);obtain ⟨a6,b6,c6⟩:=Zz x _ 1 1 rfl ד א b5 (by simpa using c5);exact ((ϙ א).mpr ⟨b6,c6⟩).symm @[inline] def Ybm (m:ו) (e:Int):ו := match e+149 with | .ofNat k=>m<<Ἄ m (k+1) @[inline] def YaO (neg:Bool) (m:ו) (e:Int):ז := 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ڨ lemma Zb5 (neg:Bool) (m:ו) (e:Int) (hm:mڇ≠0) (h:(m.toNatڕ:Int)+e < -126) : YaO neg m e=ϗ (ἴ Ϡ neg (Ὠ Ϡ neg) (match e-Ϡ.minSubnormalExponent with | ἃ shift=>mڇ<<Ϙ mڇ (shift+1))):=by have h2:mڇ<2^(m.toNatڕ+1):=ϔ;rw [show e-Ϡ.minSubnormalExponent=e+149 by rw [show Ϡ.minSubnormalExponent=-149 from rfl];omega];unfold YaO Ybm;generalize hs:e+149=s;suffices H:∀ (fr:ו) (F:Nat),frڇ=F-> F<=2^23-> (if fr==0 then Yv neg 0 0 else if (0x800000:ו)<= fr then Yv neg 1 0 else Yv neg 0 frڨ)=ϗ (ἴ Ϡ neg (Ὠ Ϡ neg) F) by cases s with | ofNat k => have hk:(k:Int)=e+149:=by grind have hb:mڇ*2^k<2^23:=by calc mڇ*2^k<2^(m.toNatڕ+1)*2^k:=Λ h2 (χ k) _=2^(m.toNatڕ+1+k):=by rw [<- Ζ] _<=2^23:=ξ ב א apply H _ (mڇ<< have hk:ἔ k=e+149:=by rw [hs] apply H _ _ (ἆ m (k+1)) have hq:mڇ/2^(k+1)<2^23:=by rw [Τ (χ _)] calc mڇ<2^(m.toNatڕ+1):=h2 _<=2^(23+(k+1)):=ξ ב (by rw [Int.negSucc_eq] at hk;omega) _=2^23*2^(k+1):=by rw [Ζ] have:=ἢ mڇ (k+1);omega intro fr F hF h5;subst hF;unfold ἴ;by_cases h0:fr=0 . subst h0;simp only [show ((0:ו)==0)=true from rfl];exact Zb4 neg have h4:(frڇ==0)=false:=by simpa using λ h=>h0 (θ.mp (by simpa using h)) simp only [show (fr==0)=false by simpa using h0,h4,τ,ت];by_cases h1:frڇ >= 2^23 . have:(0x800000:ו)<= fr:=by rw [η];simpa using h1 simp only [this,ث,show frڇ >= ἠ Ϡ.fracWidth from h1] exact ZT neg 1 0 ד ד . have:¬ (0x800000:ו)<= fr:=by rw [η];simpa using h1 simp only [this,ت,show ¬ frڇ >= ἠ Ϡ.fracWidth from h1] have hc:fr.toUInt32ڇ=frڇ:=by rw [ϻ];omega rw [ZT neg 0 _ ד (by rw [hc];omega),hc];rfl @[inline] def YK (m L:ו):ו := if 23<= L then Ἄ m (L-23).toNat else m<<<(23-L) @[inline] def Yae (neg:Bool) (m L:ו) (t:Int):ז := let rm:=YK m L if rm==0x1000000 then (if t+1 > 127 then Yv neg 255 0 else Yv neg (t+128).toNatڨ 0) else Yv neg (t+127).toNatڨ (rmڨ-0x800000) lemma Z7 (m:ו) (hm:m≠0):(YK m (Yj m))ڇ=(if Ϡ.fracWidth<= m.toNatڕ then Ϙ mڇ (m.toNatڕ-Ϡ.fracWidth) else mڇ<<<(Ϡ.fracWidth-m.toNatڕ)) /\ 2^23<=(YK m (Yj m))ڇ/\(YK m (Yj m))ڇ<=2^24:=by have h3:mڇ≠0:=λ h=>hm (θ.mp (by simpa using h));have hL:=Zj m hm;have h0:2^m.toNatڕ<= mڇ:=ϕ h3;have h1:mڇ<2^(m.toNatڕ+1):=ϔ;rw [show Ϡ.fracWidth=23 from rfl];unfold YK;generalize Yj m=L at hL ⊢;generalize hN:m.toNatڕ=N at * by_cases h:23<= N . have hu:(23:ו)<= L:=by rw [η,hL];simp;omega have hs:(L-23).toNat=N-23:=by simp_all simp only [hu,ث,h,hs,ἆ] have h4:2^23<= mڇ/2^(N-23):=by rw [ϝ (χ _),<- Ζ,show 23+(N-23)=N by omega] exact h0 have h6:mڇ/2^(N-23)<2^24:=by rw [Τ (χ _),<- Ζ,show 24+(N-23)=N+1 by omega];exact h1 have:=FloatLib.Numerics.div_two_pow_le_roundShiftRightEven mڇ (N-23);have:=ἢ mڇ (N-23);refine ⟨trivial,by omega,by omega⟩ . have hu:¬ (23:ו)<= L:=by rw [η,hL];simp;omega have hs:(23-L).toNat=23-N:=by rw [κ _ _ (by rw [η,hL];simp;omega),hL];rfl simp only [hu,ت,h];have h2:2^23<= mڇ*2^(23-N):=by calc 2^23=2^N*2^(23-N):=by rw [<- Ζ];congr 1;omega _<= mڇ*2^(23-N):=Α _ h0 have h5:mڇ*2^(23-N)<2^24:=by calc mڇ*2^(23-N)<2^(N+1)*2^(23-N):=Λ h1 (χ _) _=2^24:=by rw [<- Ζ];congr 1;omega have he:(m<<<(23-L))ڇ=mڇ*2^(23-N):=by rw [ω,hs,ζ (show 23-N<64 by omega),π];exact ζ א rw [he,π];exact ⟨rfl,h2,by omega⟩ lemma Zb6 (neg:Bool) (m:ו) (e:Int) (hm:m≠0) (h1:¬ ((m.toNatڕ:Int)+e > 127)) (h2:¬ ((m.toNatڕ:Int)+e < -126)) : Yae neg m (Yj m) ((m.toNatڕ:Int)+e)=ϗ (Ὤ Ϡ neg (ᾅ Ϡ neg) (↑m.toNatڕ+e) (if Ϡ.fracWidth<= m.toNatڕ then Ϙ mڇ (m.toNatڕ-Ϡ.fracWidth) else mڇ<<<(Ϡ.fracWidth-m.toNatڕ))):=by obtain ⟨hr,h5,h4⟩:=Z7 m hm;rw [<- hr];unfold Yae Ὤ;generalize YK m (Yj m)=rm at h5 h4 ⊢;generalize (m.toNatڕ:Int)+e=t at h1 h2 ⊢;simp only [Model.pow2_eq_two_pow,show Ϡ.fracWidth=23 from rfl,show Ϡ.maxNormalExponent=127 from rfl,show Ϡ.exponentBias=127 from rfl,show Ϡ.maxFiniteExpField=254 from rfl, show Ϡ.maxFiniteFracField=8388607 from rfl,Nat.reducePow,Nat.reduceAdd,Int.ofNat_eq_natCast,Nat.cast_ofNat] by_cases hc:rmڇ=16777216 . have h0:(rm==0x1000000)=true:=by rw [خ];apply θ.mp;rw [hc];rfl simp only [h0,ث,hc,BEq.rfl,Nat.reduceSub];by_cases ho:t+1 > 127 . simp only [ho,ث];exact ZaG neg . simp only [ho,ت];have hE:((t+128).toNat.toUInt32).toNat=(t+1+127).toNat:=by rw [Ὂ,ἦ,ζ א];omega have h3:((t+1+127).toNat > 254||((t+1+127).toNat==254&&decide (0 > 8388607)))=false:=by grind simp only [h3,τ,ت];rw [ZT neg _ 0 (by rw [hE];omega) ד,hE];rfl . have h0:(rm==0x1000000)=false:=by rw [beq_eq_false_iff_ne];intro h;apply hc;rw [h];rfl have h6:(rmڇ==16777216)=false:=by grind simp only [h0,h6,τ,ت,show ¬ t > 127 by omega] have hE:((t+127).toNat.toUInt32).toNat=(t+127).toNat:=by rw [Ὂ,ἦ,ζ א] have hF:(rm.toUInt32-0x800000).toNat=rm.toNat-8388608:=by rw [Ἵ _ _ (by rw [Ἶ,ϻ];simp;omega),ϻ];simp;omega have h3:((t+127).toNat > 254||((t+127).toNat==254&&decide (rm.toNat-8388608 > 8388607)))=false:=by grind simp only [h3,τ,ت];rw [ZT neg _ _ (by rw [hE];omega) (by rw [hF];omega),hE,hF] @[inline] def YA (neg:Bool) (m:ו) (e:Int):ז := let L:=Yj m let t:Int:=(Lڇ:Int)+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 (neg:Bool) (m:ו) (e:Int) (hm:m≠0):YA neg m e=ϗ (Χ Ϡ ⟨neg,mڇ,e⟩):=by have h0:mڇ≠0:=λ h=>hm (θ.mp (by simpa using h));have hL:=Zj m hm;unfold YA Χ;simp only [show (mڇ==0)=false by simpa using h0,τ,ت,hL,show Ϡ.maxNormalExponent=127 from rfl,show Ϡ.minNormalExponent=-126 from rfl] by_cases h1:(m.toNatڕ:Int)+e > 127 . simp only [h1,ث];exact ZaG neg . simp only [h1,ت];by_cases h2:(m.toNatڕ:Int)+e < -126 . simp only [h2,ث];exact Zb5 neg m e h0 h2 . simp only [h2,ت];exact Zb6 neg m e hm h1 h2 @[noinline] def Ybn (neg:Bool) (m:ו) (e:Int):ז:=YA neg m e @[noinline] def Yat (neg:Bool) (m:ו) (e:Int) (L c:ו):ז := YA neg m (e+((Lڇ+cڇ:Nat):Int)) @[inline] def YY (n:ו):ו := let q:=n>>>40 q+(((n&&&0xFFFFFFFFFF)+0x7FFFFFFFFF+(q&&&1))>>>40) lemma Zb7 (n:ו):(YY n)ڇ=Ϙ nڇ 40:=by rw [FloatLib.Numerics.roundShiftRightEven_eq_guard_sticky _ _ ד];have hn:=n.toNat_lt;have h1:(n>>>40)ڇ=nڇ/2^40:=by rw [Δ,ρ];rfl have h2:(n&&&0xFFFFFFFFFF).toNat=n.toNat%2^40:=by rw [ὠ,show (0xFFFFFFFFFF:ו).toNat=2^40-1 from rfl,Ψ] have h3:((n>>>40)&&&1).toNat=n.toNat/2^40%2:=by simp_all have g1:nڇ/2^(40-1)%2=nڇ%2^40/2^39:=by rw [show (2:Nat)^40=2^39*2 by norm_num,Nat.mod_mul_right_div_self] have g2:nڇ%2^(40-1)=nڇ%2^40%2^39:=by rw [show (2:Nat)^40=2^39*2 by norm_num,Nat.mod_mul_right_mod] have hR:=Ρ nڇ (show 0<2^40 by decide);have hQ:nڇ/2^40<2^24:=by rw [Τ ד];exact hn unfold YY;simp only [ι,Δ,h1,h2,h3,Nat.testBit_eq_decide_div_mod_eq,g1,g2];clear h1 h2 h3 g1 g2;generalize nڇ%2^40=R at * generalize nڇ/2^40=Q at * simp only [ᾆ,Nat.reduceMod,Nat.reducePow,ρ] at * split . rename_i h;simp at h;omega . rename_i h;simp at h;omega lemma Z8 (neg:Bool) (E F:ז) (h:Eڇ*2^23+Fڇ<2^31):(Yv neg E F)ڇ=(if neg then 2^31 else 0)+Eڇ*2^23+Fڇ:=by unfold Yv;cases neg <;> simp <;> omega @[inline] def YZ (neg:Bool) (u n:ו):ז := (if neg then (0x80000000:ז) else 0)+((u<<<23)+YY n)ڨ lemma Zb8 (neg:Bool) (u n:ו) (hu:uڇ<=253) (hq:(YY n)ڇ<=2^24):(YZ neg u n)ڇ=(if neg then 2^31 else 0)+uڇ*2^23+(YY n)ڇ:=by have hs:(u<<<23)ڇ=uڇ*2^23:=by rw [ω];simp;omega unfold YZ;cases neg <;> simp <;> omega lemma ZaH (neg:Bool) (m:ו) (e:Int) (u:ו) (hm:m≠0) (hu:(uڇ:Int)=(m.toNatڕ:Int)+e+126) (h2:uڇ<=253) : YZ neg u (m<<<(63-Yj m))=YA neg m e:=by have h5:mڇ≠0:=λ h=>hm (θ.mp (by simpa using h));have hL:=Zj m hm;obtain ⟨hr,h4,h7⟩:=Z7 m hm;have hN:m.toNatڕ<64:=(ϩ h5).mpr m.toNat_lt;have h1:mڇ<2^(m.toNatڕ+1):=ϔ;have hq:(YY (m<<<(63-Yj m)))ڇ=(YK m (Yj m))ڇ:=by rw [Zb7,hr];have hs:(63-Yj m).toNat=63-m.toNat.log2:=by rw [κ _ _ (by rw [η,hL];simp;omega -splitDisjunctions),hL];rfl have h3:(m<<<(63-Yj m))ڇ=mڇ*2^(63-m.toNatڕ):=by rw [ω,hs,ζ (show 63-m.toNatڕ<64 by omega),π];apply ζ calc mڇ*2^(63-m.toNatڕ)<2^(m.toNatڕ+1)*2^(63-m.toNatڕ):= Λ h1 (χ _) _=2^64:=by rw [<- Ζ,show m.toNatڕ+1+(63-m.toNatڕ)=64 by omega] rw [h3,show Ϡ.fracWidth=23 from rfl];split . rw [show (40:Nat)=(m.toNatڕ-23)+(63-m.toNatڕ) by omega,FloatLib.Numerics.roundShiftRightEven_mul_two_pow] . rw [FloatLib.Numerics.roundShiftRightEven_mul_two_pow_of_le _ _ _ א,π,show 63-m.toNatڕ-40=23-m.toNatڕ by omega] have h6:(YY (m<<<(63-Yj m)))ڇ<=2^24:=א rw [show YA neg m e=Yae neg m (Yj m) ((m.toNatڕ:Int)+e) by unfold YA;simp only [hL,show ¬ ((m.toNatڕ:Int)+e > 127) by omega -splitDisjunctions,show ¬ ((m.toNatڕ:Int)+e < -126) by omega -splitDisjunctions,ت]] apply Η.mp rw [Zb8 neg u _ h2 h6,hq] unfold Yae generalize YK m (Yj m)=rm at hq h4 h7 ⊢ generalize (m.toNatڕ:Int)+e=t at hu ⊢ by_cases hc:rmڇ=16777216 . have h0:(rm==0x1000000)=true:=by rw [خ];apply θ.mp;rw [hc];rfl simp only [h0,ث] by_cases ho:t+1 > 127 . simp only [ho,ث];rw [Z8 neg 255 0 ד];simp;omega . simp only [ho,ت] have hE:((t+128).toNat.toUInt32).toNat=(t+128).toNat:=by rw [Ὂ,ἦ,ζ א] rw [Z8 neg _ 0 (by rw [hE];simp;omega),hE];simp;omega . have h0:(rm==0x1000000)=false:=by rw [beq_eq_false_iff_ne];intro h;apply hc;rw [h];rfl simp only [h0,τ,ت] have hE:((t+127).toNat.toUInt32).toNat=(t+127).toNat:=by rw [Ὂ,ἦ,ζ א] have hF:(rm.toUInt32-0x800000).toNat=rm.toNat-8388608:=by rw [Ἵ _ _ (by rw [Ἶ,ϻ];simp;omega -splitDisjunctions),ϻ];simp;omega rw [Z8 neg _ _ (by rw [hE,hF];omega),hE,hF];omega lemma ZaI (neg:Bool) (n:ו) (E:Int) (u:ו) (hn:2^63<= nڇ) (hu:(uڇ:Int)=E+189) (h3:uڇ<=253) : YZ neg u n=YA neg n E:=by have h2:nڇ≠0:=Ἤ.mp (lt_of_lt_of_le (χ 63) hn);have h1:n≠0:=λ h=>h2 (by rw [h];rfl);have h0:n.toNatڕ=63:=(ϙ h2).mpr ⟨hn,n.toNat_lt⟩;have hL:Yj n=63:=θ.mp (by rw [Zj n h1,h0];rfl);have:=ZaH neg n E u h1 (by rw [h0];push_cast;omega) h3;rw [hL,show n<<<(63-63:ו)=n from θ.mp (by rw [ω];simp only [UInt64.reduceSub,Nat.zero_mod,Nat.shiftLeft_zero];exact ζ n.toNat_lt)] at this exact this lemma Zb9 (e:Int) (c:ו) (hc:cڇ<2^62) (h:(Int64.ofInt e).toInt=e) (hu:((Int64.ofInt e).toUInt64+c).toNat<=253) : (((Int64.ofInt e).toUInt64+c).toNat:Int)=e+c.toNat:=by have h1:=Int64.toInt_lt (Int64.ofInt e);have h2:=Int64.le_toInt (Int64.ofInt e);have hx:((Int64.ofInt e).toUInt64ڇ:Int)=e%2^64:=by simp;exact ὕ (Int.emod_nonneg _ ד) rw [ι] at hu ⊢;omega def Y0 (e:Int) (ok:Bool) (B:ו):Prop := ∀ c:ו,cڇ<2^62-> ok=true-> (B+c)ڇ<=253-> ((B+c)ڇ:Int)=e+cڇ lemma ZaJ (e:Int):Y0 e ((Int64.ofInt e).toInt==e) (Int64.ofInt e).toUInt64:=λ c hc h0 hu=>Zb9 e c hc (beq_iff_eq.mp h0) hu @[inline] def Yau (neg:Bool) (m:ו) (e:Int) (ok:Bool) (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 ZaK (neg:Bool) (m:ו) (e:Int) (ok:Bool) (B:ו) (hm:m≠0) (hr:Y0 e ok B):Yau neg m e ok B=YA neg m e:=by have h3:mڇ≠0:=λ h=>hm (θ.mp (by simpa using h));have hL:=Zj m hm;have hN:m.toNatڕ<64:=(ϩ h3).mpr m.toNat_lt;unfold Yau Ybn;dsimp only;split . rename_i h;simp at h;obtain ⟨h1,h2⟩:=h;have hc:(Yj m+126).toNat=m.toNat.log2+126:=by rw [ι,hL];simp;omega rw [ὡ] at h2 ⊢;have h0:(B+(Yj m+126)).toNat<=253:=by have:=η.mp h2;simpa using this have hw:=hr _ (by rw [hc];omega) h1 h0;rw [hc] at hw;exact ZaH neg m e _ hm (by rw [hw];push_cast;omega) h0 . rfl @[inline] def YaP (w:ו) (e:Int) (negZero ok:Bool) (B:ו):ז := if w=0 then (if negZero then 0x80000000 else 0) else let neg:=w>>>63 != 0 Yau neg (if neg then 0-w else w) e ok B lemma Zca (w:ו) (e:Int) (negZero ok:Bool) (B:ו) (hr:Y0 e ok B):YaP w e negZero ok B=Γ (Ym w) e negZero:=by unfold YaP Γ;by_cases hw:w=0 . subst hw;simp [Ym] . have h7:wڇ≠0:=λ h=>hw (θ.mp (by simpa using h)) have h6:=w.toNat_lt have h2:(w>>>63)ڇ=wڇ/2^63:=by rw [Δ,ρ];rfl obtain ⟨h5,h3,hS⟩:(w>>>63 != 0)=decide (Ym w<0) /\ (if (w>>>63 != 0)=true then 0-w else w)ڇ=(Ym w)ڭ/\Ym w≠0:=by by_cases h:wڇ<2^63 . have hv:Ym w=(wڇ:Int):=by unfold Ym;simp;omega have h0:(w>>>63 != 0)=false:=by simp;apply θ.mp;rw [h2];simp;omega rw [hv,h0];simp only [τ,ت,ὗ];refine ⟨by simp,trivial,by omega⟩ . have hv:Ym w=(wڇ:Int)-2^64:=by unfold Ym;simp only [h,ت] have h1:(w>>>63 != 0)=true:=by simp;intro e;have:=ص Ἀ e;rw [h2] at this simp at this;omega have h4:(0-w).toNat=2^64-w.toNat:=by rw [ϧ];simp;omega rw [hv,h1];simp only [ث,h4];refine ⟨by simp;omega,by omega,by omega⟩ simp only [hw,ت,hS];rw [<- ύ];have hm:(if (w>>>63 != 0)=true then 0-w else w)≠0:=by grind rw [ZaK _ _ _ _ _ hm hr,ZU _ _ _ hm,h3,h5];rfl def YaQ (w:ו) (e:Int) (negZero:Bool):ז := YaP w e negZero ((Int64.ofInt e).toInt==e) (Int64.ofInt e).toUInt64 lemma ZaL (w:ו) (e:Int) (negZero:Bool):YaQ w e negZero=Γ (Ym w) e negZero := Zca w e negZero _ _ (ZaJ e) lemma Zcb (V s:Nat) (h:s+25<= Vڕ):(Υ V s)ڕ=Vڕ-s:=by have hV:V≠0:=by intro h0;subst h0;simp at h have h4:2^Vڕ<= V:=ϕ hV have h5:V<2^(Vڕ+1):=ϔ have h1:2^(Vڕ-s)<= V/2^s:=by rw [ϝ (χ _),<- Ζ,show Vڕ-s+s=Vڕ by omega];exact h4 have h3:V/2^s<2^(Vڕ-s+1):=by rw [Τ (χ _),<- Ζ,show Vڕ-s+1+s=Vڕ+1 by omega];exact h5 unfold Υ;simp only;split . exact (ϙ א).mpr ⟨h1,h3⟩ . rw [ϰ];split . rename_i _ h6 apply (ϙ א).mpr refine ⟨by omega,?_⟩ have h2:2^(Vڕ-s+1)%2=0:=ג omega . exact (ϙ א).mpr ⟨h1,h3⟩ lemma ZaM (neg:Bool) (V s:Nat) (e:Int) (h:s+25<= Vڕ):Χ Ϡ ⟨neg,Υ V s,e+s⟩=Χ Ϡ ⟨neg,V,e⟩:=by have hV:V≠0:=by intro h0;subst h0;simp at h have h1:2^s<= V:=le_trans (ξ ב א) (ϕ hV) have hx:Υ V s≠0:=FloatLib.Numerics.shiftRightJam_ne_zero V s h1 have hl:=Zcb V s h unfold Χ simp only [show (Υ V s==0)=false by simpa using hx,show (V==0)=false by simpa using hV,τ,ت,hl] have ht:((Vڕ-s:Nat):Int)+(e+s)=Vڕ+e:=א rw [ht] split . rfl . split . rename_i _ h2;have h3:Ϡ.minSubnormalExponent=-149:=rfl;have h6:(V.log2:Int)+e < -126:=lt_of_lt_of_eq h2 rfl;obtain ⟨a,ha⟩:∃ a:Nat,e-Ϡ.minSubnormalExponent=ἔ a/\s+2<= a+1:=by refine ⟨(-(e+149)-1).toNat,?_,by omega⟩;rw [h3,Int.negSucc_eq];omega have hb:e+(s:Int)-Ϡ.minSubnormalExponent=ἔ (a-s):=א rw [ha.1,hb];simp only;rw [show a-s+1=a+1-s by omega,ἕ V s (a+1) ha.2] . rename_i _ h2 have h5:Ϡ.fracWidth<= Vڕ-s:=by rw [show Ϡ.fracWidth=23 from rfl];omega have h4:Ϡ.fracWidth<= Vڕ:=א simp only [h5,h4,ث] rw [show Ϡ.fracWidth=23 from rfl,show Vڕ-s-23=Vڕ-23-s by omega,ἕ V s (Vڕ-23) א] lemma Z9 (hi lo Lw:ו) (L:Nat) (h2:Lwڇ=L) (hL:L<=63) (h4:hiڇ<2^(L+1)):((hi<<<(63-Lw))|||((lo>>>Lw)>>>1))ڇ=(hiڇ*2^64+loڇ)/2^(L+1) /\ ((lo<<<(63-Lw)) != 0)=decide ((hiڇ*2^64+loڇ)%2^(L+1)≠0):=by have hs:(63-Lw).toNat=63-L:=by rw [κ _ _ (by rw [η,h2];simp;omega),h2];rfl have hp:(2:Nat)^64=2^(63-L)*2^(L+1):=by rw [<- Ζ];congr 1;omega have hA:(hi<<<(63-Lw))ڇ=hiڇ*2^(63-L):=by rw [ω,hs,ζ (show 63-L<64 by omega),π] apply ζ calc hiڇ*2^(63-L)<2^(L+1)*2^(63-L):=Λ h4 (χ _) _=2^64:=by rw [<- Ζ];congr 1;omega have hB:((lo>>>Lw)>>>1)ڇ=loڇ/2^(L+1):=by rw [Δ,Δ,h2,ζ (show L<64 by omega)];simp only [ᾆ,Nat.reduceMod,ρ,ϐ,<- Nat.pow_succ] have h7:loڇ/2^(L+1)<2^(63-L):=by rw [Τ (χ _),<- hp];exact lo.toNat_lt have h3:(hiڇ*2^64+loڇ)/2^(L+1)=hiڇ*2^(63-L)+loڇ/2^(L+1):=by rw [hp,<- ϋ,ϑ,ϭ _ _ (χ _),ϑ] have h6:(hiڇ*2^64+loڇ)%2^(L+1)=loڇ%2^(L+1):=by rw [hp,<- ϋ,ϑ,ϖ] refine ⟨?_,?_⟩ . rw [UInt64.toNat_or,hA,hB,h3,<- π,<- ἧ h7] . rw [h6];have hC:(lo<<<(63-Lw))ڇ=loڇ%2^(L+1)*2^(63-L):=by rw [ω,hs,ζ (show 63-L<64 by omega),π,hp,Μ (2^(63-L)),Nat.mul_mod_mul_right] have h5:0<2^(63-L):=χ _;by_cases h0:loڇ%2^(L+1)=0 . have:lo<<<(63-Lw)=0:=θ.mp (by rw [hC,h0,Κ];simp);simp [this,h0] . have:lo<<<(63-Lw)≠0:=λ e=>by have h1:=ص Ἀ e;rw [hC,Κ] at h1;rcases ἁ.mp h1 with h | h . exact h0 h . exact absurd h (Ἤ.mp h5) simp [this,h0] @[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 (w2 w1 w0:ו) (h:w2ڇ*2^128+w1ڇ*2^64+w0ڇ≠0):(Yax w2 w1 w0)ڇ*2^128+(Yaw w1 w0)ڇ*2^64+(Yav w0)ڇ=2^192-(w2ڇ*2^128+w1ڇ*2^64+w0ڇ):=by have a2:=w2.toNat_lt;have a1:=w1.toNat_lt;have a0:=w0.toNat_lt;unfold Yax Yaw Yav;have n2:=ἇ w2;have n1:=ἇ w1;have n0:=ἇ w0;by_cases z0:w0=0 . have z0':w0ڇ=0:=by simp_all by_cases z1:w1=0 . have z1':w1ڇ=0:=by grind simp only [z0,z1,Bool.and_self,ث,ἇ] at * simp at *;omega . have z1b:(w1==0)=false:=by grind have z1':w1ڇ≠0:=λ h=>z1 (θ.mp (by rw [h];rfl)) simp only [z0,z1b,ض,Bool.false_and,τ,ت,ث,ι,ἇ] at * simp at *;omega . have z0b:(w0==0)=false:=by grind have z0':w0ڇ≠0:=λ h=>z0 (θ.mp (by rw [h];rfl)) simp only [z0b,Bool.and_false,τ,ت,ι,ἇ] at * simp at *;omega @[inline] def Yaf (neg:Bool) (m2 m1 m0:ו) (e:Int):ז := 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:Nat):Int)) @[inline] def Yag (neg:Bool) (m1 m0:ו) (e:Int):ז := 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:Nat):Int)) @[inline] def Yay (neg:Bool) (m2 m1 m0:ו) (e:Int):ז := 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 ZaN (x:ו) (st:Bool) (Q R:Nat) (hx:xڇ=Q) (h0:st=decide (R≠0)) (hQ:2<= Q):(if st then x|||1 else x)ڇ=(if R==0 then Q else Q|||1):=by subst hx h0;by_cases hR:R=0 . simp [hR] . simp [hR] lemma Zcd (neg:Bool) (m1 m0:ו) (e:Int) (h1:m1≠0):Yag neg m1 m0 e=ϗ (Χ Ϡ ⟨neg,m1ڇ*2^64+m0ڇ,e⟩):=by have a1:=m1.toNat_lt;have a0:=m0.toNat_lt unfold Yag have h5:m1ڇ≠0:=λ h=>h1 (θ.mp (by rw [h];rfl)) have hK:=Zj m1 h1 generalize h0:m1.toNatڕ=K at hK have h8:K<=63:=by rw [<- h0];have:=(ϩ h5).mpr m1.toNat_lt;omega have h6:m1ڇ<2^(K+1):=by rw [<- h0];exact ϔ have h4:2^K<= m1ڇ:=by rw [<- h0];exact ϕ h5 obtain ⟨hx,h2⟩:=Z9 m1 m0 (Yj m1) K hK h8 h6 generalize Yj m1=L at hK hx h2 ⊢ have hQ:2<=(m1ڇ*2^64+m0ڇ)/2^(K+1):=by rw [ϝ (χ _)] calc 2*2^(K+1)=2^K*2^2:=by rw [<- Ζ,<- Nat.pow_succ'] _<= m1ڇ*2^64:=Ἓ h4 (ξ ב ב) _<= _:=ό _ _ have hj:=ZaN _ _ _ _ hx h2 hQ;have h7:(if ((m0<<<(63-L)) != 0)=true then ((m1<<<(63-L))|||((m0>>>L)>>>1))|||1 else (m1<<<(63-L))|||((m0>>>L)>>>1))≠0:=by intro h;have h3:=ص Ἀ h;rw [hj,Κ] at h3;split at h3 . omega . rw [ϰ] at h3;split at h3 <;> omega rw [ZU _ _ _ h7,hj,hK];have h9:(m1ڇ*2^64+m0ڇ)ڕ=64+K:=by apply (ϙ א).mpr;constructor . calc 2^(64+K)=2^K*2^64:=by rw [<- Ζ,ϑ] _<= m1ڇ*2^64:=Α _ h4 _<= _:=ό _ _ . calc m1ڇ*2^64+m0ڇ< m1ڇ*2^64+2^64:=א _=(m1ڇ+1)*2^64:=by ring _<=2^(K+1)*2^64:=Α _ h6 _=2^(64+K+1):=by rw [<- Ζ,ϑ (K+1),ϱ] have:=ZaM neg (m1ڇ*2^64+m0ڇ) (K+1) e א;unfold Υ at this;rw [this] lemma Zce (neg:Bool) (m2 m1 m0:ו) (e:Int) (h2:m2≠0):Yaf neg m2 m1 m0 e=ϗ (Χ Ϡ ⟨neg,m2ڇ*2^128+m1ڇ*2^64+m0ڇ,e⟩):=by have a1:=m1.toNat_lt;have a0:=m0.toNat_lt;unfold Yaf;have h0:m2ڇ≠0:=λ h=>h2 (θ.mp (by rw [h];rfl));have hM:m2ڇ*2^128+m1ڇ*2^64+m0ڇ≠0:=by have hp:0< m2ڇ*2^128:=ϓ (Ο h0) (χ _);rw [ϱ];exact Nat.ne_of_gt (Nat.lt_of_lt_of_le hp (ό _ _)) have hK:=Zj m2 h2 generalize h4:m2.toNatڕ=K at hK have hd:K<=63:=by rw [<- h4];have:=(ϩ h0).mpr m2.toNat_lt;omega have h5:m2ڇ<2^(K+1):=by rw [<- h4];exact ϔ have h8:2^K<= m2ڇ:=by rw [<- h4];exact ϕ h0 obtain ⟨hx,h1⟩:=Z9 m2 m1 (Yj m2) K hK hd h5 generalize Yj m2=L at hK hx h1 ⊢ obtain ⟨A,hA⟩:∃ A,m2ڇ*2^64+m1ڇ=A:=⟨_,rfl⟩ rw [hA] at hx h1 have hb:A=A/2^(K+1)*2^(K+1)+A%2^(K+1):=(ἣ A _).symm have hg:A%2^(K+1)<2^(K+1):=Ρ _ (χ _) have h6:(2:Nat)^(K+65)=2^(K+1)*2^64:=by grind have h7:m2ڇ*2^128+m1ڇ*2^64+m0ڇ=(A%2^(K+1)*2^64+m0ڇ)+A/2^(K+1)*2^(K+65):=by have:m2ڇ*2^128+m1ڇ*2^64=A*2^64:=by rw [<- hA];ring rw [this,h6];conv_lhs=>rw [hb] ring have h9:A%2^(K+1)*2^64+m0ڇ<2^(K+65):=by rw [h6] calc A%2^(K+1)*2^64+m0ڇ< A%2^(K+1)*2^64+2^64:=א _=(A%2^(K+1)+1)*2^64:=by ring _<=2^(K+1)*2^64:=Α _ hg have hQ:(m2ڇ*2^128+m1ڇ*2^64+m0ڇ)/2^(K+65)=A/2^(K+1):=by rw [h7,ϭ _ _ (χ _),϶ h9,Ϩ] have hR:(m2ڇ*2^128+m1ڇ*2^64+m0ڇ)%2^(K+65)=A%2^(K+1)*2^64+m0ڇ:=by rw [h7,ϖ,ζ h9] have hc:((m1<<<(63-L) != 0)||(m0 != 0))=decide ((m2ڇ*2^128+m1ڇ*2^64+m0ڇ)%2^(K+65)≠0):=by rw [h1,hR];have hf:(m0 != 0)=decide (m0ڇ≠0):=by by_cases h:m0=0 . subst h;rfl . have:m0ڇ≠0:=λ h'=>h (θ.mp (by rw [h'];rfl));simp [h,this] rw [hf];by_cases hz:A%2^(K+1)=0 <;> by_cases hh:m0ڇ=0 <;> simp have ha:2<= A/2^(K+1):=by rw [ϝ (χ _),<- hA] calc 2*2^(K+1)=2^K*2^2:=by rw [<- Ζ,<- Nat.pow_succ'] _<= m2ڇ*2^64:=Ἓ h8 (ξ ב ב) _<= _:=ό _ _ rw [<- hQ] at hx ha;have hj:=ZaN _ _ _ _ hx hc ha;have he:(if ((m1<<<(63-L) != 0)||(m0 != 0))=true then ((m2<<<(63-L))|||((m1>>>L)>>>1))|||1 else (m2<<<(63-L))|||((m1>>>L)>>>1))≠0:=by intro h;have h3:=ص Ἀ h;rw [hj,Κ] at h3;split at h3 . omega . rw [ϰ] at h3;split at h3 <;> omega rw [ZU _ _ _ he,hj,hK];have hi:(m2ڇ*2^128+m1ڇ*2^64+m0ڇ)ڕ=128+K:=by apply (ϙ hM).mpr;constructor . calc 2^(128+K)=2^K*2^128:=by rw [<- Ζ,ϑ] _<= m2ڇ*2^128:=Α _ h8 _<= _:=by rw [ϱ];exact ό _ _ . have:m1ڇ*2^64+m0ڇ<2^128:=by calc m1ڇ*2^64+m0ڇ< m1ڇ*2^64+2^64:=Ἥ a0 _ _=(m1ڇ+1)*2^64:=by ring _<=2^64*2^64:=Α _ a1 _=2^128:=by rw [<- Ζ] calc m2ڇ*2^128+m1ڇ*2^64+m0ڇ< m2ڇ*2^128+2^128:=by rw [ϱ];exact Ἥ this _ _=(m2ڇ+1)*2^128:=by ring _<=2^(K+1)*2^128:=Α _ h5 _=2^(128+K+1):=by rw [<- Ζ,ϑ (K+1),ϱ] have:=ZaM neg (m2ڇ*2^128+m1ڇ*2^64+m0ڇ) (K+65) e א;unfold Υ at this;rw [this] lemma ZaO (neg:Bool) (m2 m1 m0:ו) (e:Int) (hM:m2ڇ*2^128+m1ڇ*2^64+m0ڇ≠0) : Yay neg m2 m1 m0 e=ϗ (Χ Ϡ ⟨neg,m2ڇ*2^128+m1ڇ*2^64+m0ڇ,e⟩):=by unfold Yay;by_cases h2:m2=0 . subst h2;simp only [ت,Κ,ᾁ,Ϩ] at hM ⊢;by_cases h1:m1=0 . subst h1;simp at hM ⊢;exact ZU neg m0 e (λ h=>hM (by rw [h];rfl)) . simp only [show (m1 != 0)=true by simpa using h1,ث];exact Zcd neg m1 m0 e h1 . simp only [show (m2 != 0)=true by simpa using h2,ث];exact Zce neg m2 m1 m0 e h2 lemma ZaP (hi lo Lw:ו) (L:Nat) (h0:Lwڇ=L) (hL:L<=63) (h1:hiڇ<2^(L+1)) (h2:2^L<= hiڇ) (st:Bool) : 2^63<=(if st then ((hi<<<(63-Lw))|||((lo>>>Lw)>>>1))|||1 else (hi<<<(63-Lw))|||((lo>>>Lw)>>>1))ڇ:=by obtain ⟨hx,-⟩:=Z9 hi lo Lw L h0 hL h1;have hQ:2^63<=(hiڇ*2^64+loڇ)/2^(L+1):=by rw [ϝ (χ _)] calc 2^63*2^(L+1)=2^L*2^64:=by rw [<- Ζ,<- Ζ,show 63+(L+1)=L+64 by omega] _<= hiڇ*2^64:=Α _ h2 _<= _:=ό _ _ cases st . simp only [τ,ت];rw [hx];exact hQ . simp only [ث];rw [UInt64.toNat_or,hx,show (1:ו)ڇ=1 from rfl,ϰ];split <;> omega @[inline] def YaR (neg:Bool) (m1 m0:ו) (e:Int) (ok:Bool) (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 Zcf (neg:Bool) (m1 m0:ו) (e:Int) (ok:Bool) (B:ו) (h1:m1≠0) (hr:Y0 e ok B):YaR neg m1 m0 e ok B=Yag neg m1 m0 e:=by have h2:m1ڇ≠0:=λ h=>h1 (θ.mp (by rw [h];rfl)) have hK:=Zj m1 h1 generalize h0:m1.toNatڕ=K at hK have h5:K<=63:=by rw [<- h0];have:=(ϩ h2).mpr m1.toNat_lt;omega have h4:m1ڇ<2^(K+1):=by rw [<- h0];exact ϔ have h6:2^K<= m1ڇ:=by rw [<- h0];exact ϕ h2 have hn:=ZaP m1 m0 (Yj m1) K hK h5 h4 h6 unfold YaR Yag Yat dsimp only generalize Yj m1=L at hK hn ⊢ split . rename_i h simp at h obtain ⟨ha,hb⟩:=h have hc:(L+190).toNat=K+190:=by rw [ι,hK];simp;omega rw [ὡ] at hb ⊢ have h3:(B+(L+190)).toNat<=253:=by have:=η.mp hb;simpa using this have hw:=hr _ (by rw [hc];omega) ha h3;rw [hc] at hw;exact ZaI neg _ _ _ (hn _) (by rw [hw];push_cast;omega) h3 . rfl @[inline] def YaS (neg:Bool) (m2 m1 m0:ו) (e:Int) (ok:Bool) (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 Zcg (neg:Bool) (m2 m1 m0:ו) (e:Int) (ok:Bool) (B:ו) (h2:m2≠0) (hr:Y0 e ok B):YaS neg m2 m1 m0 e ok B=Yaf neg m2 m1 m0 e:=by have h1:m2ڇ≠0:=λ h=>h2 (θ.mp (by rw [h];rfl)) have hK:=Zj m2 h2 generalize h0:m2.toNatڕ=K at hK have h5:K<=63:=by rw [<- h0];have:=(ϩ h1).mpr m2.toNat_lt;omega have h4:m2ڇ<2^(K+1):=by rw [<- h0];exact ϔ have h6:2^K<= m2ڇ:=by rw [<- h0];exact ϕ h1 have hn:=ZaP m2 m1 (Yj m2) K hK h5 h4 h6 unfold YaS Yaf Yat dsimp only generalize Yj m2=L at hK hn ⊢ split . rename_i h simp at h obtain ⟨ha,hb⟩:=h have hc:(L+254).toNat=K+254:=by rw [ι,hK];simp;omega rw [ὡ] at hb ⊢ have h3:(B+(L+254)).toNat<=253:=by have:=η.mp hb;simpa using this have hw:=hr _ (by rw [hc];omega) ha h3;rw [hc] at hw;exact ZaI neg _ _ _ (hn _) (by rw [hw];push_cast;omega) h3 . rfl @[inline] def Yaz (neg:Bool) (m2 m1 m0:ו) (e:Int) (ok:Bool) (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 ZaQ (neg:Bool) (m2 m1 m0:ו) (e:Int) (ok:Bool) (B:ו) (hM:m2ڇ*2^128+m1ڇ*2^64+m0ڇ≠0) (hr:Y0 e ok B) : Yaz neg m2 m1 m0 e ok B=Yay neg m2 m1 m0 e:=by unfold Yaz Yay;by_cases h2:m2=0 . subst h2;simp only [ت,Κ,Ϩ] at hM ⊢;by_cases h1:m1=0 . subst h1;simp at hM ⊢;exact ZaK neg m0 e ok B (λ h=>hM (by rw [h];rfl)) hr . simp only [show (m1 != 0)=true by simpa using h1,ث];exact Zcf neg m1 m0 e ok B h1 hr . simp only [show (m2 != 0)=true by simpa using h2,ث];exact Zcg neg m2 m1 m0 e ok B h2 hr @[inline] def YaT (w2 w1 w0:ו) (e:Int) (negZero ok:Bool) (B:ו):ז := if w2=0/\w1=0/\w0=0 then (if negZero then 0x80000000 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 Zch (w2 w1 w0:ו) (e:Int) (negZero ok:Bool) (B:ו) (hr:Y0 e ok B):YaT w2 w1 w0 e negZero ok B=Γ (YC w2 w1 w0) e negZero:=by have a2:=w2.toNat_lt;have a1:=w1.toNat_lt;have a0:=w0.toNat_lt;have hV:w2ڇ*2^128+w1ڇ*2^64+w0ڇ<2^192:=by have:w1ڇ*2^64+w0ڇ<2^128:=by calc w1ڇ*2^64+w0ڇ< w1ڇ*2^64+2^64:=Ἥ a0 _ _=(w1ڇ+1)*2^64:=by ring _<=2^64*2^64:=Α _ a1 _=2^128:=by rw [<- Ζ] calc w2ڇ*2^128+w1ڇ*2^64+w0ڇ< w2ڇ*2^128+2^128:=by rw [ϱ];exact Ἥ this _ _=(w2ڇ+1)*2^128:=by ring _<=2^64*2^128:=Α _ a2 _=2^192:=by rw [<- Ζ] have h4:(w2>>>63)ڇ=w2ڇ/2^63:=by rw [Δ,ρ];rfl unfold YaT Γ;by_cases hz:w2=0/\w1=0/\w0=0 . obtain ⟨r2,r1,r0⟩:=hz;subst r2 r1 r0;simp [YC] have h2:w2ڇ*2^128+w1ڇ*2^64+w0ڇ≠0:=by intro h0;apply hz;obtain ⟨h5,hc⟩:=ὒ.mp h0;obtain ⟨ha,hb⟩:=ὒ.mp h5;have z2:w2ڇ=0:=(ἁ.mp ha).resolve_right (Ἤ.mp (χ _));have z1:w1ڇ=0:=(ἁ.mp hb).resolve_right (Ἤ.mp (χ _));exact ⟨θ.mp (by rw [z2];rfl),θ.mp (by rw [z1];rfl),θ.mp (by rw [hc];rfl)⟩ simp only [hz,ت];generalize hN:w2ڇ*2^128+w1ڇ*2^64+w0ڇ=N at hV h2;by_cases hn:w2ڇ<2^63 . have hv:YC w2 w1 w0=(N:Int):=by unfold YC;rw [hN];simp only [hn,ث,Int.sub_zero] have h0:(w2>>>63 != 0)=false:=by simp;apply θ.mp;rw [h4];simp;omega have hS:YC w2 w1 w0≠0:=א simp only [h0,τ,ت,hS] rw [<- ύ,ZaQ false w2 w1 w0 e _ _ (by rw [hN];exact h2) hr, ZaO false w2 w1 w0 e (by rw [hN];exact h2),hN] unfold ofIntDyadic;rw [hv,ὗ,decide_eq_false (Int.not_lt.mpr (Int.natCast_nonneg N))] . have hv:YC w2 w1 w0=(N:Int)-2^192:=by unfold YC;rw [hN];simp only [hn,ت] have h1:(w2>>>63 != 0)=true:=by simp;intro e;have:=ص Ἀ e;rw [h4] at this;simp at this;omega have h6:(N:Int)-2^192=-((2^192-N:Nat):Int):=א have hS:YC w2 w1 w0≠0:=א have h3:=Zcc w2 w1 w0 (by rw [hN];exact h2);rw [hN] at h3;have hM:(Yax w2 w1 w0)ڇ*2^128+(Yaw w1 w0)ڇ*2^64+(Yav w0)ڇ≠0:=א simp only [h1,ث,hS,ت];rw [<- ύ,ZaQ true _ _ _ e _ _ hM hr,ZaO true _ _ _ e hM,h3] unfold ofIntDyadic;rw [hv,h6,Int.natAbs_neg,ὗ,decide_eq_true (Int.neg_neg_of_pos (Int.natCast_pos.mpr (Nat.sub_pos_of_lt hV)))] def Ybo (w2 w1 w0:ו) (e:Int) (negZero:Bool):ז := YaT w2 w1 w0 e negZero ((Int64.ofInt e).toInt==e) (Int64.ofInt e).toUInt64 lemma Zci (w2 w1 w0:ו) (e:Int) (negZero:Bool):Ybo w2 w1 w0 e negZero=Γ (YC w2 w1 w0) e negZero := Zch w2 w1 w0 e negZero _ _ (ZaJ e) @[inline] def Yf (w:ז):ו := if Ξ w=0 then (ὥ w)ڈ else (ὥ w)ڈ+0x800000 @[inline] def Yd (w:ז):ו := if Ξ w=0 then 0 else (Ξ w)ڈ-1 lemma Zk (w:ז):(Yf w)ڇ=δ w:=by have:=ὑ w;unfold Yf δ;split_ifs . simp . simp only [ι];show ((ὥ w)ڇ+8388608)%2^64=2^23+(ὥ w)ڇ omega lemma Zf (w:ז):(Yd w)ڇ=γ w:=by unfold Yd γ;split_ifs with h . rfl . have h1:1<=(Ξ w)ڇ:=by rcases ἒ (Ξ w)ڇ with h0 | h0 . exact absurd (Η.mp (by simpa using h0)) h . exact h0 rw [κ _ _ (by rw [η];simp;omega)];simp lemma Zc (a b:USize) (h:aڇ+bڇ< Ϝ):(a+b)ڇ=aڇ+bڇ:=by exact ζ h lemma Zaa (A:Array ο) (base n k:USize) (hA:baseڇ+nڇ<= Aڑ) (hs:baseڇ+nڇ< Ϝ) (h:k< n):(base+k)ڇ< Aڑ:=by have hk:=υ.mp h;rw [Zc _ _ א];omega lemma ZI (n k:USize) (h:k< n):n.toNat-(k+1).toNat< n.toNat-k.toNat:=by have hk:=υ.mp h;have hn:=ϣ n;rw [Zc _ _ (by simp;omega),ϸ];omega lemma ZaR (s:ו):(s&&&63).toNat=s.toNat%64:=by rw [ὠ,show (63:ו)ڇ=2^6-1 from rfl,Ψ] lemma Zcj (r:ו) (h0:r.toNat<64):(63-r).toNat=63-r.toNat:=by rw [κ _ _ (by rw [η];show r.toNat<=63;omega)];rfl lemma ZaS (m r:ו) (h0:rڇ<64):(m<<>>1)>>>(63-r))ڇ=mڇ/2^(64-rڇ):=by rw [Δ,Δ,Zcj r h0,ρ,ρ,ζ (show 63-rڇ<64 by omega), show (1:ו)ڇ%64=1 from rfl,ϐ,<- Ζ] congr 2;omega lemma ZaU (m r:Nat) (hr:r<64):m*2^r%2^64+m/2^(64-r)*2^64=m*2^r:=by have h:m*2^r/2^64=m/2^(64-r):=by rw [show (2:Nat)^64=2^r*2^(64-r) by rw [<- Ζ];congr 1;omega,<- ϐ,Nat.mul_div_cancel _ (χ r)] rw [<- h];exact Nat.mod_add_div' _ _ lemma Zck (m s:ו) (h0:sڇ<64):((m>>>1)>>>(63-(s&&&63)))ڇ*2^64+(m<<<(s&&&63))ڇ =mڇ*2^sڇ:=by have hr:(s&&&63).toNat=s.toNat:=by rw [ZaR];exact ζ h0 rw [ZaS _ _ א,ZaT _ _ א,hr] have Zh:=ZaU mڇ sڇ h0 omega lemma Zcl (m s:ו) (h1:64<= sڇ) (h2:sڇ<128):((m>>>1)>>>(63-(s&&&63)))ڇ*2^128+(m<<<(s&&&63))ڇ*2^64 =mڇ*2^sڇ:=by have hr:(s&&&63).toNat=s.toNat-64:=by rw [ZaR];omega rw [ZaS _ _ א,ZaT _ _ א,hr] have Zh:=ZaU mڇ (sڇ-64) א have hp:mڇ*2^sڇ=mڇ*2^(sڇ-64)*2^64:=by rw [ϋ,<- Ζ];congr 2;omega omega lemma Zcm (m s:ו) (hs: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 [ة h,ة h,ة h,Κ,ᾁ,Ϩ];exact Zck m s (ε.mp h) . rw [ب h,ب h,ب h,Κ,ὣ];exact Zcl m s (by have:=ε.not.mp h;simp at this;omega) hs lemma Zab (y ng:ו) (h:ng.toNat<=1):(y^^^(0-ng)).toNat=if ng.toNat=1 then 2^64-1-y.toNat else y.toNat:=by rcases Ἔ.mp h with h0 | h1 . have:ng=0:=θ.mp (by simpa using h0);subst this;simp . have:ng=1:=θ.mp (by simpa using h1) subst this have hm:(0-1:ו)=⟨BitVec.allOnes 64⟩:=ד 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+b< a then (1:ו) else 0)ڇ=(aڇ+bڇ)/2^64:=by have ha:aڇ<2^64:=Β a;have hb:bڇ<2^64:=Β b;have hs:(a+b)ڇ=(aڇ+bڇ)%2^64:=ι a b;refine ⟨hs,?_⟩;split_ifs with h . rw [ε,hs] at h;show 1=_;omega . rw [ε,hs] at h;show 0=_;omega lemma Zcn (w2 w1 w0 z2 z1 z0:ו):(w2+z2+((if w1+z1< w1 then (1:ו) else 0) ||| (if w1+z1+(if w0+z0< w0 then (1:ו) else 0)< w1+z1 then 1 else 0))).toNat *2^128 + (w1+z1+(if w0+z0< w0 then (1:ו) else 0))ڇ*2^64+(w0+z0)ڇ = (w2ڇ*2^128+w1ڇ*2^64+w0ڇ+(z2ڇ*2^128+z1ڇ*2^64+z0ڇ))%2^192:=by obtain ⟨h6,h4⟩:=ZJ w0 z0;obtain ⟨h5,h3⟩:=ZJ w1 z1;generalize hk:(if w0+z0< w0 then (1:ו) else 0)=k0 at h4 ⊢;obtain ⟨h7,h0⟩:=ZJ (w1+z1) k0;generalize (if w1+z1< w1 then (1:ו) else 0)=ka at h3 ⊢;generalize (if w1+z1+k0< w1+z1 then (1:ו) else 0)=kb at h0 ⊢;have hc:w1ڇ<2^64:=Β w1;have hb:z1ڇ<2^64:=Β z1;have h9:w0ڇ<2^64:=Β w0;have ha:z0ڇ<2^64:=Β z0;have h8:(ka|||kb)ڇ=kaڇ+kbڇ:=by simp have:kaڇ+kbڇ<=1:=by rw [h3,h0,h5];omega -splitDisjunctions rcases ὄ kaڇ 1 with h1 | h1 <;> rcases ὄ kbڇ 1 with h2 | h2 . rw [show kaڇ=0 by omega,show kbڇ=0 by omega];rfl . rw [show kaڇ=0 by omega,Nat.zero_or];omega . rw [show kbڇ=0 by omega,Nat.or_zero];omega . omega -splitDisjunctions rw [ι,ι,h8,h7,h6,h3,h0,h5,h4];omega lemma Zco (w2 w1 w0 c:ו):(w2+(if w1+(if w0+c< w0 then (1:ו) else 0)< w1 then (1:ו) else 0))ڇ *2^128 + (w1+(if w0+c< w0 then (1:ו) else 0))ڇ*2^64+(w0+c)ڇ = (w2ڇ*2^128+w1ڇ*2^64+w0ڇ+cڇ)%2^192:=by obtain ⟨h2,h0⟩:=ZJ w0 c;generalize (if w0+c< w0 then (1:ו) else 0)=k0 at h0 ⊢;obtain ⟨h1,h3⟩:=ZJ w1 k0;rw [ι,h1,h2,h3,h0];omega lemma Zcp (t2 t1 t0:ו) (S:Int) (h3:-2^191<= S) (h2:S<2^191) (h:((t2ڇ*2^128+t1ڇ*2^64+t0ڇ:Nat):Int)=S%2^192) : YC t2 t1 t0=S:=by have h1:t1ڇ<2^64:=Β t1;have h0:t0ڇ<2^64:=Β t0;unfold YC;split_ifs with hc <;> omega lemma Zcq (t0 t1 t2:ו):((t0|||t1|||t2)==0)=decide (t2ڇ*2^128+t1ڇ*2^64+t0ڇ=0):=by have h0:t0=0 ↔ t0ڇ=0:=by rw [<- θ];simp have h1:t1=0 ↔ t1ڇ=0:=by rw [<- θ];simp have h2:t2=0 ↔ t2ڇ=0:=by rw [<- θ];simp rw [ἀ,خ,ذ,Ὧ,Ὧ,h0,h1,h2] omega lemma Zcr (a b:ז):((a^^^b)>>>31).toUInt64ڇ=if ὀ (φ a) (φ b) then 1 else 0:=by have ha:aڇ<2^32:=ώ a;have hb:bڇ<2^32:=ώ b;have h0:φ a=decide (aڇ/2^31=1):=by unfold φ;have h1:(aڇ&&&2^31)%2^31=0:=by rw [Nat.and_mod_two_pow,Nat.mod_self,Nat.and_zero] have h2:(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] have h3:(a&&&0x80000000).toNat=a.toNat&&&2^31:=ג have h4:(a&&&0x80000000 != 0)=decide ((a&&&0x80000000).toNat≠0):=by rw [ἀ,bne_iff_ne,ذ,ne_eq,ne_eq,<- Η];simp rw [h4,h3,ἀ,ذ,ذ];omega have h5:φ b=decide (bڇ/2^31=1):=by unfold φ;have h1:(bڇ&&&2^31)%2^31=0:=by rw [Nat.and_mod_two_pow,Nat.mod_self,Nat.and_zero] have h2:(bڇ&&&2^31)/2^31=bڇ/2^31%2:=by rw [Nat.and_div_two_pow,Nat.div_self (χ 31),Nat.and_one_is_mod] have h3:(b&&&0x80000000).toNat=b.toNat&&&2^31:=ג have h4:(b&&&0x80000000 != 0)=decide ((b&&&0x80000000).toNat≠0):=by rw [ἀ,bne_iff_ne,ذ,ne_eq,ne_eq,<- Η];simp rw [h4,h3,ἀ,ذ,ذ];omega rw [ϊ,ϳ,UInt32.toNat_xor,show (31:ז)ڇ%32=31 from rfl,Nat.shiftRight_xor_distrib, ρ,ρ,h0,h5] have:aڇ/2^31<=1:=א have:bڇ/2^31<=1:=א rcases Ἔ.mp ‹aڇ/2^31<=1› with h | h <;> rcases Ἔ.mp ‹bڇ/2^31<=1› with h' | h' <;> rw [h,h'] <;> 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)ڈ let mk:ו:=0-ng let s0:=w0+(y0^^^mk) let k0:ו:=if s0< w0 then 1 else 0 let u1:=w1+(y1^^^mk) let ka:ו:=if u1< w1 then 1 else 0 let s1:=u1+k0 let kb:ו:=if s1< u1 then 1 else 0 kont (w2+(y2^^^mk)+(ka|||kb)) s1 s0 (c+ng) def Yx (w2 w1 w0:ו):Nat:=w2ڇ*2^128+w1ڇ*2^64+w0ڇ lemma Zcs (m s:ו) (hm:mڇ=0):(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)ڇ=0:=by have h0:m=0:=θ.mp (by simpa using hm);subst h0;split_ifs <;> simp <;> rfl lemma Zg (w:ז):γ w<=254:=by have:=Ὗ w;unfold γ;split_ifs <;> omega lemma ZK (a b:ז):δ a*δ b<2^48:=calc δ a*δ b<2^24*2^24:= Ϫ (Ω a) (Ω b) lemma Zr {β:Type} (lo:ו) (a b:ז) (w2 w1 w0 c:ו) (kont:ו-> ו-> ו-> ו-> β) (hc:cڇ+1<2^64) (hw:δ a*δ b≠0-> loڇ<= γ a+γ b/\γ a+γ b< loڇ+128) : ∃ v2 v1 v0 c',YL lo a b w2 w1 w0 c kont=kont v2 v1 v0 c' /\ c'ڇ<= cڇ+1 /\ ((Yx v2 v1 v0+c'ڇ:Nat):Int)%2^192=((Yx w2 w1 w0+cڇ:Nat)+sv a*sv b*2^(γ a+γ b-loڇ)) % 2^192:=by have hM:=ZK a b;have h3:=Zcr a b;have h4:(Yf a*Yf b)ڇ=δ a*δ b:=by rw [Ϛ,Zk,Zk];exact ζ (by omega -splitDisjunctions) refine ⟨_,_,_,_,rfl,?_,?_⟩;all_goals generalize Yf a*Yf b=m at h4 ⊢;generalize hs:Yd a+Yd b-lo=s;generalize ((a^^^b)>>>31)ڈ=ng at h3 ⊢ . rw [ι] have:ngڇ<=1:=by rw [h3];split_ifs <;> omega -splitDisjunctions omega -splitDisjunctions · have hY:(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-loڇ):=by by_cases h0:δ a*δ b=0 . rw [h0,ᾁ];exact Zcs m s (by rw [h4,h0]) . obtain ⟨h1,h2⟩:=hw h0;have h7:sڇ=γ a+γ b-loڇ:=by rw [<- hs,κ _ _ (by rw [η,ι,Zf,Zf];have:=Zg a;have:=Zg b;rw [ζ (by omega -splitDisjunctions)];omega -splitDisjunctions), ι,Zf,Zf] have:=Zg a;have:=Zg b;rw [ζ (by omega -splitDisjunctions)] rw [<- h4,<- h7];exact Zcm m s א generalize (if s<64 then (0:ו) else (m>>>1)>>>(63-(s&&&63)))=y2 at hY ⊢ generalize (if s<64 then (m>>>1)>>>(63-(s&&&63)) else m<<<(s&&&63))=y1 at hY ⊢ generalize (if s<64 then m<<<(s&&&63) else 0)=y0 at hY ⊢ have h5:ngڇ<=1:=by grind have z2:=Zab y2 ng h5 have z1:=Zab y1 ng h5 have z0:=Zab y0 ng h5 have hd:y2ڇ<2^64:=Β y2 have ha:y1ڇ<2^64:=Β y1 have hf:y0ڇ<2^64:=Β y0 unfold Yx rw [Zcn,ι,ζ (a:=cڇ+ngڇ) (by omega -splitDisjunctions),<- Zn] generalize hP:δ a*δ b*2^(γ a+γ b-loڇ)=P at hY;have h6:(if ὀ (φ a) (φ b) then -((δ a*δ b:Nat):Int) else ((δ a*δ b:Nat):Int))*2^(γ a+γ b-loڇ) = if ὀ (φ a) (φ b) then -(P:Int) else (P:Int):=by rw [<- hP];split_ifs <;> push_cast <;> ring rw [h6] have he:w0ڇ<2^64:=Β w0 have hb:w1ڇ<2^64:=Β w1 have h8:w2ڇ<2^64:=Β w2 split_ifs at h3 z2 z1 z0 ⊢ with hx h9 <;> omega @[inline] def YD (w2 w1 w0 c:ו) (e:Int):ו := let t0:=w0+c let k0:ו:=if t0< w0 then 1 else 0 let t1:=w1+k0 let k1:ו:=if t1< w1 then 1 else 0 let t2:=w2+k1 if (t0|||t1|||t2)==0 then 0x100000000 else (Ybo t2 t1 t0 e false)ڈ lemma ZV (w2 w1 w0 c:ו) (e S:Int) (h0:-2^191<= S) (h1:S<2^191) (h:((Yx w2 w1 w0+cڇ:Nat):Int)%2^192=S%2^192) : YD w2 w1 w0 c e=if S=0 then 0x100000000 else (Γ S e false)ڈ:=by have ha:=Zco w2 w1 w0 c;unfold YD;simp only [];generalize (w0+c)=t0 at ha ⊢;generalize (w1+(if t0< w0 then (1:ו) else 0))=t1 at ha ⊢;generalize (w2+(if t1< w1 then (1:ו) else 0))=t2 at ha ⊢;have hv:((t2ڇ*2^128+t1ڇ*2^64+t0ڇ:Nat):Int)=S%2^192:=by rw [ha,<- h];unfold Yx;push_cast;omega have hi:=Zcp t2 t1 t0 S h0 h1 hv;rw [Zcq];by_cases hS:S=0 . subst hS have:t2ڇ*2^128+t1ڇ*2^64+t0ڇ=0:=א rw [decide_eq_true this,ة rfl,ة rfl] . have:t2ڇ*2^128+t1ڇ*2^64+t0ڇ≠0:=א simp only [this,decide_false,τ,hS,Zci,hi] lemma Za (x:Nat) (h:x<4294967296):x.toUSizeڇ=x:=by exact ζ (Nat.lt_of_lt_of_le h Ϧ) lemma Zac (A:Array ο) (base k:USize) (h:(base+k)ڇ< Aڑ) (hb:baseڇ+kڇ< Ϝ) : A.uget (base+k) h=A[baseڇ+kڇ]!:=by have he:=Zc base k hb;rw [ح A (baseڇ+kڇ) א];show A[(base+k)ڇ]=_;simp only [he] def YR (a:ז):Nat:=(((a&&&0x7FFFFFFF)-1)>>>23)ڇ def YM (a:ז):Nat:=((a&&&0x7FFFFFFF)>>>23)ڇ lemma Zct (a:ז):(a&&&0x7FFFFFFF).toNat=(Ξ a).toNat*2^23+(ὥ a).toNat:=by simp only [UInt32.toNat_and,Ξ,ὥ,ϳ];rw [show (0x7FFFFFFF:ז)ڇ=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 hv:=Zct a;have hE:=Ὗ a;have hF:=ὑ a;have h3:YR a=if (a&&&0x7FFFFFFF).toNat=0 then 511 else ((a&&&0x7FFFFFFF).toNat-1)/2^23:=by unfold YR;rw [ϳ,UInt32.toNat_sub,show (23:ז)ڇ%32=23 from rfl,ρ,show (1:ז)ڇ=1 from rfl] split_ifs with h0 <;> omega have h4:YM a=(Ξ a)ڇ:=by unfold YM;rw [ϳ,show (23:ז)ڇ%32=23 from rfl,ρ,hv] omega have h1:Ξ a=0 ↔ (Ξ a)ڇ=0:=by rw [<- Η];simp have h2:Ξ a=255 ↔ (Ξ a)ڇ=255:=by rw [<- Η];simp unfold δ γ;rw [h3,h4];refine ⟨by split_ifs <;> omega,by omega -splitDisjunctions,λ h he=>by rw [h2] at he;omega -splitDisjunctions,λ hm => ?_⟩;by_cases h0:Ξ a=0 . rw [ة h0] at hm ⊢;rw [h1] at h0;split_ifs <;> omega . rw [ب h0] at hm ⊢;rw [h1] at h0;split_ifs <;> omega def Yah (A:Array ο) (base n:USize) (hA:baseڇ+nڇ<= Aڑ) (hs:baseڇ+nڇ< Ϝ) (lo hi:ז) (k:USize):ז := if h:k< n then let v:=A.uget (base+k) (Zaa A base n k hA hs h)&&&0x7FFFFFFF let kl:=(v-1)>>>23 let kh:=v>>>23 Yah A base n hA hs (if kl< lo then kl else lo) (if hi< kh then kh else hi) (k+1) else (lo<<<16)+hi termination_by nڇ-kڇ decreasing_by exact ZI n k h lemma Zcu (A:Array ο) (base n:USize) (hA:baseڇ+nڇ<= Aڑ) (hs:baseڇ+nڇ< Ϝ) (lo hi:ז) (k:USize) (hk:kڇ<= nڇ) (ha:loڇ<=511) (h7:hiڇ<=255) : ∃ L H:Nat,(Yah A base n hA hs lo hi k)ڇ=L*2^16+H/\L<=511/\H<=255 /\ L<= loڇ/\hiڇ<= H /\ ∀ t,kڇ<= t-> t< nڇ-> L<= YR A[baseڇ+t]! /\ YM A[baseڇ+t]!<= H:=by generalize hd:nڇ-kڇ=d;induction d generalizing k lo hi with | zero => have h0:¬ k< n:=by rw [υ];omega rw [Yah,dif_neg h0] refine ⟨loڇ,hiڇ,?_,ha,h7,le_refl _,le_refl _,λ t h1 h2=>א⟩ rw [UInt32.toNat_add,UInt32.toNat_shiftLeft,show (16:ז)ڇ%32=16 from rfl,π] have:loڇ*2^16<2^32:=א rw [ζ this] omega | succ d ih => have h0:k< n:=by rw [υ];omega have he:(k+1).toNat=k.toNat+1:=by rw [Zc _ _ (by have:=ϣ n;simp;omega),ϸ] rw [Yah,dif_pos h0] dsimp only rw [Zac A base k _ א] generalize hw:A[baseڇ+kڇ]! =w have hf:(((w&&&0x7FFFFFFF)-1)>>>23)ڇ=YR w:=rfl have hg:((w&&&0x7FFFFFFF)>>>23)ڇ=YM w:=rfl obtain ⟨k1,k2,-,-⟩:=Zb w obtain ⟨L,H,h1,h2,h3,h5,h6,h4⟩:=ih (if ((w&&&0x7FFFFFFF)-1)>>>23< lo then ((w&&&0x7FFFFFFF)-1)>>>23 else lo) (if hi<(w&&&0x7FFFFFFF)>>>23 then (w&&&0x7FFFFFFF)>>>23 else hi) (k+1) א (by split_ifs <;> omega) (by split_ifs <;> omega) א have hh:(if ((w&&&0x7FFFFFFF)-1)>>>23< lo then ((w&&&0x7FFFFFFF)-1)>>>23 else lo)ڇ<= loڇ/\(if ((w&&&0x7FFFFFFF)-1)>>>23< lo then ((w&&&0x7FFFFFFF)-1)>>>23 else lo)ڇ<= YR w:=by split_ifs with hc . rw [ἓ] at hc;omega . rw [ἓ] at hc;omega have hj:hiڇ<=(if hi<(w&&&0x7FFFFFFF)>>>23 then (w&&&0x7FFFFFFF)>>>23 else hi)ڇ/\YM w<=(if hi<(w&&&0x7FFFFFFF)>>>23 then (w&&&0x7FFFFFFF)>>>23 else hi)ڇ:=by split_ifs with hc . rw [ἓ] at hc;omega . rw [ἓ] at hc;omega refine ⟨L,H,h1,h2,h3,by omega,by omega,λ t hb h9 => ?_⟩;rcases ὄ t (kڇ+1) with ht | ht . have h8:t=kڇ:=א subst h8 rw [hw] omega . exact h4 t א h9 def YS (X W:Array ο) (xa wa n:USize) (hX:xaڇ+nڇ<= Xڑ) (hW:waڇ+nڇ<= Wڑ) (hx:xaڇ+nڇ< Ϝ) (hw:waڇ+nڇ< Ϝ) (lo:ו) (e:Int) (bw:ז) (w2 w1 w0 c:ו) (k:USize):ו := if h:k< n then YL lo (X.uget (xa+k) (Zaa X xa n k hX hx h)) (W.uget (wa+k) (Zaa W wa n k hW hw h)) w2 w1 w0 c λ v2 v1 v0 c'=>YS 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 def YB (X W:Array ο) (xa wa lo k:Nat):Nat-> Int | 0=>0 | r+1=>sv X[xa+k]!*sv W[wa+k]!*2^(γ X[xa+k]!+γ W[wa+k]! - lo) + YB X W xa wa lo (k+1) r lemma Zcv (X W:Array ο) (xa wa n:USize) (hX:xaڇ+nڇ<= Xڑ) (hW:waڇ+nڇ<= Wڑ) (hx:xaڇ+nڇ< Ϝ) (hw:waڇ+nڇ< Ϝ) (lo:ו) (e:Int) (bw:ז) (hn:nڇ<2^32) (h9:δ ϒ*δ bw≠0-> loڇ<= γ ϒ+γ bw/\γ ϒ+γ bw< loڇ+128) : ∀ (d:Nat) (k:USize) (w2 w1 w0 c:ו) (S0 S:Int),nڇ-kڇ=d-> kڇ<= nڇ-> cڇ<= kڇ -> (∀ t,kڇ<= t-> t< nڇ-> δ X[xaڇ+t]!*δ W[waڇ+t]!≠0-> loڇ<= γ X[xaڇ+t]!+γ W[waڇ+t]! /\ γ X[xaڇ+t]!+γ W[waڇ+t]!< loڇ+128) -> ((Yx w2 w1 w0+cڇ:Nat):Int)%2^192=S0%2^192 -> S=S0+YB X W xaڇ waڇ loڇ kڇ (nڇ-kڇ)+sv ϒ*sv bw*2^(γ ϒ+γ bw-loڇ) -> -2^191<= S-> S<2^191 -> YS X W xa wa n hX hW hx hw lo e bw w2 w1 w0 c k=if S=0 then 0x100000000 else (Γ S e false)ڈ:=by intro d induction d with | zero => intro k w2 w1 w0 c S0 S hd hk hc h5 hv hS h6 h7 have h0:¬ k< n:=by rw [υ];omega rw [YS,dif_neg h0] obtain ⟨v2,v1,v0,c',h3,ha,h4⟩:=Zr lo ϒ bw w2 w1 w0 c (λ v2 v1 v0 c'=>YD v2 v1 v0 c' e) (by omega -splitDisjunctions) h9 rw [h3];apply ZV v2 v1 v0 c' e S h6 h7;rw [h4,hS,show nڇ-kڇ=0 by omega -splitDisjunctions,YB];omega | succ d ih => intro k w2 w1 w0 c S0 S hd hk hc h5 hv hS h6 h7 have h0:k< n:=by rw [υ];omega have h8:(k+1).toNat=k.toNat+1:=by rw [Zc _ _ (by have:=ϣ n;simp;omega),ϸ] rw [YS,dif_pos h0,Zac X xa k _ (by omega -splitDisjunctions),Zac W wa k _ (by omega -splitDisjunctions)] obtain ⟨v2,v1,v0,c',h3,ha,h4⟩:=Zr lo X[xaڇ+kڇ]! W[waڇ+kڇ]! w2 w1 w0 c (λ v2 v1 v0 c'=>YS X W xa wa n hX hW hx hw lo e bw v2 v1 v0 c' (k+1)) (by omega -splitDisjunctions) (h5 kڇ (le_refl _) א) rw [h3] refine ih (k+1) v2 v1 v0 c' (S0+sv X[xaڇ+kڇ]!*sv W[waڇ+kڇ]!*2^(γ X[xaڇ+kڇ]!+γ W[waڇ+kڇ]! - loڇ)) S א א (by omega -splitDisjunctions) (λ t h1 h2=>h5 t (by omega -splitDisjunctions) h2) ?_ ?_ h6 h7 . rw [h4];omega . rw [hS,show n.toNat-k.toNat=(n.toNat-(k+1).toNat)+1 by omega,YB,h8];ring lemma ZL (a b:ז) (lo:Nat) (h:δ a*δ b≠0-> lo<= γ a+γ b/\γ a+γ b<= lo+122) : -(2^170:Int)<= sv a*sv b*2^(γ a+γ b-lo) /\ sv a*sv b*2^(γ a+γ b-lo)<=2^170:=by rw [<- Zn];have hM:=ZK a b;by_cases h0:δ a*δ b=0 . rw [h0];split_ifs <;> simp . obtain ⟨h1,h2⟩:=h h0;have hp:2^(γ a+γ b-lo)<=2^122:=ξ ב א;have hP:δ a*δ b*2^(γ a+γ b-lo)<=2^170:=calc δ a*δ b*2^(γ a+γ b-lo)<=2^48*2^122:= Ἓ א hp _=2^170:=ב have Zh:((δ a*δ b:Nat):Int)*2^(γ a+γ b-lo)=((δ a*δ b*2^(γ a+γ b-lo):Nat):Int):=by push_cast;ring split_ifs . rw [neg_mul,Zh];omega . rw [Zh];omega lemma Zcw (X W:Array ο) (xa wa lo:Nat):∀ (r k:Nat),(∀ t,k<= t-> t< k+r-> δ X[xa+t]!*δ W[wa+t]!≠0-> lo<= γ X[xa+t]!+γ W[wa+t]! /\ γ X[xa+t]!+γ W[wa+t]!<= lo+122) -> -((r:Int)*2^170)<= YB X W xa wa lo k r/\YB X W xa wa lo k r<=(r:Int)*2^170:=by intro r;induction r with | zero=>intro k _;simp [YB] | succ r ih => intro k h;obtain ⟨a1,a2⟩:=ZL X[xa+k]! W[wa+k]! lo (h k (le_refl _) א);obtain ⟨b1,b2⟩:=ih (k+1) (λ t h1 h2=>h t א א);rw [YB];push_cast;constructor <;> linarith lemma ZW (fa fb:Nat-> ז):∀ r k,Yo fa fb k (r+1)=Yo fa fb k r+sv (fa (k+r))*sv (fb (k+r))*2^(γ (fa (k+r))+γ (fb (k+r))):=by intro r;induction r with | zero=>intro k;simp [Yo] | succ r ih => intro k;rw [Yo,ih (k+1),Yo,show k+1+r=k+(r+1) by omega];ring lemma ZA (a b:ז) (lo:Nat) (h:δ a*δ b≠0-> lo<= γ a+γ b):sv a*sv b*2^(γ a+γ b)=2^lo*(sv a*sv b*2^(γ a+γ b-lo)):=by by_cases h0:δ a*δ b=0 . have:sv a*sv b=0:=by rw [<- Zn,h0];split_ifs <;> simp rw [this];ring . have h1:=h h0;rw [show γ a+γ b=lo+(γ a+γ b-lo) by omega,ز];rw [show lo+(γ a+γ b-lo)-lo=γ a+γ b-lo by omega];ring lemma Zcx (X W:Array ο) (inW xa wa lo:Nat) (bw:ז):∀ r k,k+r<= inW-> (∀ t,k<= t-> t< k+r-> δ X[xa+t]!*δ W[wa+t]!≠0-> lo<= γ X[xa+t]!+γ W[wa+t]!) -> Yo (λ t=>if t< inW then X[xa+t]! else ϒ) (λ t=>if t< inW then W[wa+t]! else bw) k r=2^lo*YB X W xa wa lo k r:=by intro r;induction r with | zero=>intro k _ _;simp [Yo,YB] | succ r ih => intro k hk h;rw [Yo,YB,ih (k+1) א (λ t h1 h2=>h t א א)];simp only [show k< inW by omega,if_true];rw [ZA _ _ lo (h k (le_refl _) א)];ring @[inline] def Yc (A:Array ο) (inW i:Nat):ז := if h:i*inW+inW<= Aڑ/\i*inW+inW<=4294967295 then Yah A (i*inW)ژ inWژ (by rw [Za _ א,Za _ א];exact h.1) (by rw [Za _ א,Za _ א];have:=Ϧ;omega) 511 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)&&xb< lo0 then xb else lo0 @[inline] def Yu (bx bv bw:ז):ו := let hi0:=Yk (bx&&&0xFFFF)+Yk (bv&&&0xFFFF) let xb:=Yd ϒ+Yd bw if !(Yf bw==0)&&hi0< xb then xb else hi0 @[noinline] def Yai (X W b:Array ο) (inW i j:Nat):ο := Yn (inW+1) (λ t=>if 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)ڈ let mk:ו:=0-ng let s0:=w0+(y0^^^mk) let k0:ו:=if s0< w0 then 1 else 0 let u1:=w1+(y1^^^mk) let ka:ו:=if u1< w1 then 1 else 0 let s1:=u1+k0 let kb:ו:=if s1< u1 then 1 else 0 kont (w2+mk+(ka|||kb)) s1 s0 (c+ng) lemma YL6e {β:Type} (lo:ו) (a b:ז) (w2 w1 w0 c:ו) (kont:ו-> ו-> ו-> ו-> β) (h:δ a*δ b=0\/(loڇ<= γ a+γ b/\γ a+γ b<= loڇ+63)) : YL6 lo a b w2 w1 w0 c kont=YL lo a b w2 w1 w0 c kont:=by unfold YL6 YL;dsimp only by_cases hs:Yd a+Yd b-lo<64 · simp only [hs,ث,UInt64.zero_xor] · have hm:Yf a*Yf b=0:=by rcases h with h|⟨h1,h2⟩ · rcases ἁ.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 hs have fa:=Zf a;have fb:=Zf b;have ia:=Zg a;have ib:=Zg b rw [ε,κ _ _ (η.mpr (by rw [ι,fa,fb];norm_num;omega)),ι,fa,fb] norm_num;omega simp only [hs,ت,hm,Ὦ,UInt64.zero_shiftRight,UInt64.zero_xor] def YS6 (X W:Array ο) (xa wa n:USize) (hX:xaڇ+nڇ<= Xڑ) (hW:waڇ+nڇ<= Wڑ) (hx:xaڇ+nڇ< Ϝ) (hw:waڇ+nڇ< Ϝ) (lo:ו) (e:Int) (bw:ז) (w2 w1 w0 c:ו) (k:USize):ו := if h:k< n then YL6 lo (X.uget (xa+k) (Zaa X xa n k hX hx h)) (W.uget (wa+k) (Zaa W wa n k hW hw h)) w2 w1 w0 c λ v2 v1 v0 c'=>YS6 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 YS6e (X W:Array ο) (xa wa n:USize) (hX:xaڇ+nڇ<= Xڑ) (hW:waڇ+nڇ<= Wڑ) (hx:xaڇ+nڇ< Ϝ) (hw:waڇ+nڇ< Ϝ) (lo:ו) (e:Int) (bw:ז) (h5:∀ t,t< nڇ-> δ X[xaڇ+t]!*δ W[waڇ+t]!≠0-> loڇ<= γ X[xaڇ+t]!+γ W[waڇ+t]! /\ γ X[xaڇ+t]!+γ W[waڇ+t]!<= loڇ+63) : ∀ (d:Nat) (k:USize) (w2 w1 w0 c:ו),nڇ-kڇ=d -> YS6 X W xa wa n hX hW hx hw lo e bw w2 w1 w0 c k=YS X W xa wa n hX hW hx hw lo e bw w2 w1 w0 c k:=by intro d induction d with | zero=> intro k w2 w1 w0 c hd have h0:¬ k< n:=by rw [υ];omega rw [YS6,YS,dif_neg h0,dif_neg h0] | succ d ih=> intro k w2 w1 w0 c hd have h0:k< n:=by rw [υ];omega have h8:(k+1).toNat=k.toNat+1:=by rw [Zc _ _ (by have:=ϣ n;simp;omega),ϸ] rw [YS6,YS,dif_pos h0,dif_pos h0,Zac X xa k _ א,Zac W wa k _ א] have hk:=h5 kڇ א rw [YL6e lo _ _ w2 w1 w0 c _ (by by_cases hm:δ X[xaڇ+kڇ]!*δ W[waڇ+kڇ]! =0;exact Or.inl hm;exact Or.inr (hk hm))] congr 1;funext v2 v1 v0 c';exact ih (k+1) v2 v1 v0 c' א @[inline] def YaU (X W b:Array ο) (inW i j:Nat) (bx bv:ז):ο := if h:i*inW+inW<= Xڑ/\j*inW+inW<= Wڑ/\i*inW+inW<=4294967295 /\ j*inW+inW<=4294967295/\inW<1048576 then let bw:=b[j]! let lo:=Yp bx bv bw let hi:=Yu bx bv bw if (bx&&&0xFFFF)=255||(bv&&&0xFFFF)=255||Ξ bw=255||hi< lo || hi-lo > 122 then Yai X W b inW i j else let r:=if hi-lo<=63 then YS6 X W (i*inW)ژ (j*inW)ژ inWژ (by rw [Za _ א,Za _ א];exact h.1) (by rw [Za _ א,Za _ א];exact h.2.1) (by rw [Za _ א,Za _ א];have:=Ϧ;omega) (by rw [Za _ א,Za _ א];have:=Ϧ;omega) lo ((loڇ:Int)-298) bw 0 0 0 0 0 else YS X W (i*inW)ژ (j*inW)ژ inWژ (by rw [Za _ א,Za _ א];exact h.1) (by rw [Za _ א,Za _ א];exact h.2.1) (by rw [Za _ א,Za _ א];have:=Ϧ;omega) (by rw [Za _ א,Za _ א];have:=Ϧ;omega) lo ((loڇ:Int)-298) bw 0 0 0 0 0 if r<0x100000000 then rڨ else Yai X W b inW i j else Yai X W b inW i j @[specialize] def Yaj (hw:Nat) (f:Nat-> Nat-> ο) (ch j:Nat) (acc:Array ο):Array ο := if j< hw then Yaj hw f ch (j+1) (acc.push (f ch j)) else acc termination_by hw-j @[specialize] def Yak (c hw:Nat) (f:Nat-> Nat-> ο) (ch:Nat) (acc:Array ο):Array ο := if ch< c then Yak c hw f (ch+1) (Yaj hw f ch 0 acc) else acc termination_by c-ch @[inline] def YT (c hw:Nat) (f:Nat-> Nat-> ο):Array ο:=Yak c hw f 0 (Ι (c*hw)) lemma Zcy (hw:Nat) (f:Nat-> Nat-> ο) (ch:Nat):∀ k j (acc:Array ο),hw-j=k-> (Yaj hw f ch j acc)ڤ=accڤ++(Φ j (hw-j)).map (f ch):=by intro k;induction k with | zero=>intro j acc h;unfold Yaj;rw [ب א];simp [h] | succ k ih=> intro j acc h;unfold Yaj;rw [ة א,ih (j+1) _ א,show hw-j=(hw-(j+1))+1 by omega,Ϟ];simp lemma Zcz (c hw:Nat) (f:Nat-> Nat-> ο):∀ k ch (acc:Array ο),c-ch=k-> (Yak c hw f ch acc)ڤ=accڤ++(Φ (ch*hw) ((c-ch)*hw)).map (λ i=>f (i/hw) (i%hw)):=by intro k;induction k with | zero=>intro ch acc h;unfold Yak;rw [ب א];simp [h] | succ k ih=> intro ch acc h;unfold Yak;rw [ة א,ih (ch+1) _ א,Zcy hw f ch _ 0 _ rfl, show (c-ch)*hw=hw+(c-(ch+1))*hw by rw [show c-ch=(c-(ch+1))+1 by omega,Ὅ,Nat.one_mul,ϑ], <- List.range'_append,List.map_append,Nat.succ_mul] simp only [List.append_assoc,Nat.sub_zero];congr 2 . rw [show Φ (ch*hw) hw=(Φ 0 hw).map (ch*hw+·) by rw [List.map_add_range'];simp,ί];apply ὐ;intro j hj;rw [ὢ] at hj;simp only [Function.comp_def,ϑ (ch*hw) j,ϭ _ _ (show 0< hw by omega),϶ (show j< hw by omega),Ϩ,ϖ,ζ (show j< hw by omega)] . simp lemma ZB (c hw N:Nat) (hN:c*hw=N) (f:Nat-> Nat-> ο):YT c hw f=ς (n:=N) λ i=>f (iک/hw) (iک%hw):=by subst hN;apply ἵ;rw [YT,Zcz c hw f _ 0 _ rfl];apply ϵ <;> simp def YaV (rows inW outW:Nat) (relu:Bool) (X W b:Array ο):Array ο := let BX:Array ז:=ς (n:=rows) λ i=>Yc X inW iک let BV:Array ז:=ς (n:=outW) λ j=>Yc W inW jک YT rows outW λ i j=>act relu (YaU X W b inW i j BX[i]! BV[j]!) lemma Zq (k:ז):(Yk k)ڇ=kڇ-1:=by unfold Yk;split_ifs with h . subst h;rfl . rw [ϊ,Ἵ _ _ (by rw [Ἶ];have:kڇ≠0:=λ h0=>h (Η.mp (by simpa using h0));show 1<= kڇ;omega)] rfl lemma ZM (bw:ז):(Yd ϒ+Yd bw)ڇ=γ ϒ+γ bw:=by rw [ι,Zf,Zf];have:=Zg ϒ;have:=Zg bw;exact ζ א lemma Zad (bx bv bw:ז):(Yp bx bv bw)ڇ<=((bx>>>16)ڇ-1)+((bv>>>16)ڇ-1) /\ (δ bw≠0-> (Yp bx bv bw)ڇ<= γ ϒ+γ bw):=by have h1:(Yk (bx>>>16)+Yk (bv>>>16))ڇ=((bx>>>16)ڇ-1)+((bv>>>16)ڇ-1):=by rw [ι,Zq,Zq];have:(bx>>>16)ڇ<2^32:=ώ _;have:(bv>>>16)ڇ<2^32:=ώ _;exact ζ א have h2:=ZM bw;have hm:(Yf bw==0)=decide (δ bw=0):=by rw [ἀ,خ,ذ,<- Zk,<- θ];rfl unfold Yp;dsimp only;rw [hm];split_ifs with hc . simp only [Ν,Ἒ,ر,ج,ε] at hc omega . simp only [Ν,Ἒ,ر,ج,ε,not_and,not_lt] at hc constructor . omega . intro hb;have:=hc hb;omega lemma Zae (bx bv bw:ז):((bx&&&0xFFFF).toNat-1)+((bv&&&0xFFFF).toNat-1)<=(Yu bx bv bw).toNat /\ (δ bw≠0-> γ ϒ+γ bw<=(Yu bx bv bw).toNat):=by have h1:(Yk (bx&&&0xFFFF)+Yk (bv&&&0xFFFF)).toNat=((bx&&&0xFFFF).toNat-1)+((bv&&&0xFFFF).toNat-1):=by rw [ι,Zq,Zq];have:(bx&&&0xFFFF).toNat<2^32:=ώ _;have:(bv&&&0xFFFF).toNat<2^32:=ώ _;exact ζ א have h2:=ZM bw;have hm:(Yf bw==0)=decide (δ bw=0):=by rw [ἀ,خ,ذ,<- Zk,<- θ];rfl unfold Yu;dsimp only;rw [hm];split_ifs with hc . simp only [Ν,Ἒ,ر,ج,ε] at hc omega . simp only [Ν,Ἒ,ر,ج,ε,not_and,not_lt] at hc constructor . omega . intro hb;have:=hc hb;omega lemma Zo (bx:ז) (L H:Nat) (h:bx.toNat=L*2^16+H) (hH:H<2^16):(bx>>>16).toNat=L/\(bx&&&0xFFFF).toNat=H:=by constructor . rw [ϳ,show (16:ז)ڇ%32=16 from rfl,ρ,h] omega . rw [UInt32.toNat_and,show (0xFFFF:ז)ڇ=2^16-1 from rfl,Ψ,h] omega lemma Zaf (X W b:Array ο) (inW i j:Nat):Yai X W b inW i j=Ἰ (inW+1) (λ t=>if t< inW then X[i*inW+t]! else ϒ) (λ t=>if t< inW then W[j*inW+t]! else b[j]!):=by unfold Yai;rw [Zi] lemma Zp (A:Array ο) (inW i:Nat) (h1:i*inW+inW<= Aڑ) (h2:i*inW+inW<=4294967295) : ∃ L H:Nat,(Yc A inW i)ڇ=L*2^16+H/\L<=511/\H<=255 /\ ∀ t,t< inW-> L<= YR A[i*inW+t]! /\ YM A[i*inW+t]!<= H:=by have h0:(i*inW).toUSizeڇ=i*inW:=Za _ א;have h3:inW.toUSizeڇ=inW:=Za _ א;unfold Yc;rw [dif_pos ⟨h1,by omega⟩];obtain ⟨L,H,e,hL,hH,-,-,h4⟩:=Zcu A (i*inW)ژ inWژ (by rw [h0,h3];exact h1) (by rw [h0,h3];have:=Ϧ;omega) 511 0 0 ג ד ד refine ⟨L,H,e,hL,hH,λ t ht => ?_⟩;have:=h4 t ג (by rw [h3];exact ht);rwa [h0] at this lemma ZgA (X W:Array ο) (inW i j:Nat) (bw:ז) (lo:ו) (hn:inW<1048576) (hb:∀ t,t< inW-> Ξ X[i*inW+t]!≠255) (he:∀ t,t< inW-> Ξ W[j*inW+t]!≠255) (hg:Ξ bw≠255) (h5:∀ t,t< inW-> δ X[i*inW+t]!*δ W[j*inW+t]!≠0-> loڇ<= γ X[i*inW+t]!+γ W[j*inW+t]! /\ γ X[i*inW+t]!+γ W[j*inW+t]!<= loڇ+122) (h1:δ ϒ*δ bw≠0-> loڇ<= γ ϒ+γ bw/\γ ϒ+γ bw<= loڇ+122) (FB:ο) (hi:FB=Ἰ (inW+1) (λ t=>if t< inW then X[i*inW+t]! else ϒ) (λ t=>if t< inW then W[j*inW+t]! else bw)) (r:ו) (hr:r=if YB X W (i*inW) (j*inW) loڇ 0 inW+sv ϒ*sv bw*2^(γ ϒ+γ bw-loڇ)=0 then 0x100000000 else (Γ (YB X W (i*inW) (j*inW) loڇ 0 inW+sv ϒ*sv bw*2^(γ ϒ+γ bw-loڇ)) ((loڇ:Int)-298) false)ڈ) : (if r<0x100000000 then rڨ else FB) = Ἰ (inW+1) (λ t=>if t< inW then X[i*inW+t]! else ϒ) (λ t=>if t< inW then W[j*inW+t]! else bw):=by have hl:=Zcw X W (i*inW) (j*inW) loڇ inW 0 (λ t _ h2 h3=>h5 t א h3) have hm:=ZL ϒ bw loڇ h1;generalize h9:YB X W (i*inW) (j*inW) loڇ 0 inW+sv ϒ*sv bw*2^(γ ϒ+γ bw-loڇ)=Srel at hr have hh:-2^191<= Srel:=א have hj:Srel<2^191:=א rw [hr];have hd:∀ k,k< inW+1-> Ξ ((λ t=>if t< inW then X[i*inW+t]! else ϒ) k)≠255 /\ Ξ ((λ t=>if t< inW then W[j*inW+t]! else bw) k)≠255:=by intro k hk;by_cases h0:k< inW . simp only [h0];exact ⟨hb k h0,he k h0⟩ . simp only [h0,if_false];exact ⟨by decide,hg⟩ have hf:Ἰ (inW+1) (λ t=>if t< inW then X[i*inW+t]! else ϒ) (λ t=>if t< inW then W[j*inW+t]! else bw) = Γ (Srel*2^loڇ) (-298) (decide (inW+1≠0) && Yq (λ t=>if t< inW then X[i*inW+t]! else ϒ) (λ t=>if t< inW then W[j*inW+t]! else bw) 0 (inW+1)):=by rw [Zy (inW+1) _ _ hd];congr 1;rw [ZW,Zcx X W inW (i*inW) (j*inW) loڇ bw inW 0 א (λ t _ h2 h3=>(h5 t א h3).1)] simp;rw [ZA ϒ bw loڇ (λ h=>(h1 h).1),<- h9];ring by_cases h4:Srel=0 . rw [ة h4,ب ד,hi] . rw [ب h4];have ha:(Γ Srel ((loڇ:Int)-298) false)ڈ<0x100000000:=by have:(Γ Srel ((loڇ:Int)-298) false)ڇ<2^32:= ώ _ rw [ε];simpa using this rw [ة ha,hf,<- Ϻ];have e1:(Γ Srel ((loڇ:Int)-298) false).toUInt64ڨ=Γ Srel ((loڇ:Int)-298) false:=by apply Η.mp;simp rw [e1];unfold Γ;rw [ب h4,ب h4,show (-298:Int)+(loڇ:Int)=(loڇ:Int)-298 by ring] lemma ZcA (X W:Array ο) (inW i j:Nat) (bw:ז) (lo:ו) (p1:(i*inW).toUSizeڇ+inW.toUSizeڇ<= Xڑ) (p2:(j*inW).toUSizeڇ+inW.toUSizeڇ<= Wڑ) (p3:(i*inW).toUSizeڇ+inW.toUSizeڇ< Ϝ) (p4:(j*inW).toUSizeڇ+inW.toUSizeڇ< Ϝ) (h8:(i*inW).toUSizeڇ=i*inW) (h6:(j*inW).toUSizeڇ=j*inW) (h7:inW.toUSizeڇ=inW) (hn:inW<1048576) (hb:∀ t,t< inW-> Ξ X[i*inW+t]!≠255) (he:∀ t,t< inW-> Ξ W[j*inW+t]!≠255) (hg:Ξ bw≠255) (h5:∀ t,t< inW-> δ X[i*inW+t]!*δ W[j*inW+t]!≠0-> loڇ<= γ X[i*inW+t]!+γ W[j*inW+t]! /\ γ X[i*inW+t]!+γ W[j*inW+t]!<= loڇ+122) (h1:δ ϒ*δ bw≠0-> loڇ<= γ ϒ+γ bw/\γ ϒ+γ bw<= loڇ+122) (FB:ο) (hi:FB=Ἰ (inW+1) (λ t=>if t< inW then X[i*inW+t]! else ϒ) (λ t=>if t< inW then W[j*inW+t]! else bw)) : (if YS X W (i*inW)ژ (j*inW)ژ inWژ p1 p2 p3 p4 lo ((loڇ:Int)-298) bw 0 0 0 0 0<0x100000000 then (YS X W (i*inW)ژ (j*inW)ژ inWژ p1 p2 p3 p4 lo ((loڇ:Int)-298) bw 0 0 0 0 0)ڨ else FB) = Ἰ (inW+1) (λ t=>if t< inW then X[i*inW+t]! else ϒ) (λ t=>if t< inW then W[j*inW+t]! else bw):=by have hl:=Zcw X W (i*inW) (j*inW) loڇ inW 0 (λ t _ h2 h3=>h5 t א h3) have hm:=ZL ϒ bw loڇ h1 apply ZgA X W inW i j bw lo hn hb he hg h5 h1 FB hi exact Zcv X W (i*inW)ژ (j*inW)ژ inWژ p1 p2 p3 p4 lo ((loڇ:Int)-298) bw א (λ h=>⟨(h1 h).1,by have:=(h1 h).2;omega⟩) inW 0 0 0 0 0 0 _ (by simp [h7]) ג ג (λ t _ h2 h3=>by rw [h8,h6] at h3 ⊢;have:=h5 t א h3;exact ⟨this.1,by omega⟩) (by simp [Yx]) (by rw [h8,h6,h7];simp) א א lemma ZQa {L r i:Nat} (h1:L<= r) (h2:r<= i+1):L-1<= i:=א lemma ZQb {m H i:Nat} (h1:m<= H) (h2:i+1<= max m 1):i<= H-1:=א lemma ZQ {p u a b c d B:Nat} {x w:ο} (wl:p<=(a-1)+(b-1)) (wh:(c-1)+(d-1)<= u) (d5:u-p<= B) (r1:a<= YR x/\YM x<= c) (r2:b<= YR w/\YM w<= d) (hm:δ x*δ w≠0):p<= γ x+γ w/\γ x+γ w<= p+B:= have k1:=(Zb x).2.2.2 (left_ne_zero_of_mul hm);have k2:=(Zb w).2.2.2 (right_ne_zero_of_mul hm);⟨wl.trans (Nat.add_le_add (ZQa r1.1 k1.1) (ZQa r2.1 k2.1)),(Nat.add_le_add (ZQb r1.2 k1.2) (ZQb r2.2 k2.2)).trans (wh.trans (Nat.sub_le_iff_le_add'.mp d5))⟩ lemma ZcB (X W b:Array ο) (inW i j:Nat):YaU X W b inW i j (Yc X inW i) (Yc W inW j)=Ἰ (inW+1) (λ t=>if t< inW then X[i*inW+t]! else ϒ) (λ t=>if t< inW then W[j*inW+t]! else b[j]!):=by unfold YaU;split . rename_i hg;obtain ⟨hk,ha,hi,hf,hd⟩:=hg;have hh:(i*inW).toUSizeڇ=i*inW:=Za _ (by omega -splitDisjunctions);have hb:(j*inW).toUSizeڇ=j*inW:=Za _ (by omega -splitDisjunctions);have he:inW.toUSizeڇ=inW:=Za _ (by omega -splitDisjunctions);obtain ⟨Lx,Hx,h5,hl,hp,h1⟩:=Zp X inW i hk hi;obtain ⟨Lv,Hv,h4,hq,ho,h8⟩:=Zp W inW j ha hf;generalize Yc X inW i=bx at h5 ⊢;generalize Yc W inW j=bv at h4 ⊢;obtain ⟨hj,h3⟩:=Zo bx Lx Hx h5 (by omega -splitDisjunctions);obtain ⟨h9,h7⟩:=Zo bv Lv Hv h4 (by omega -splitDisjunctions);obtain ⟨wl1,wl2⟩:=Zad bx bv b[j]!;obtain ⟨wh1,wh2⟩:=Zae bx bv b[j]!;dsimp only;split . exact Zaf X W b inW i j . rename_i hc;have c1:¬ (bx&&&0xFFFF)=255:=λ h=>hc (by simp [h]);have c2:¬ (bv&&&0xFFFF)=255:=λ h=>hc (by simp [h]);have c3:¬ Ξ b[j]! =255:=λ h=>hc (by simp [h]);have c4:¬ Yu bx bv b[j]!< Yp bx bv b[j]!:=λ h=>hc (by simp [h]);have c5:¬ Yu bx bv b[j]! - Yp bx bv b[j]! > 122:=λ h=>hc (by simp [h]);have d1:Hx≠255:=λ h=>c1 (Η.mp (by rw [h3,h];rfl));have d2:Hv≠255:=λ h=>c2 (Η.mp (by rw [h7,h];rfl));have d4:(Yp bx bv b[j]!)ڇ<=(Yu bx bv b[j]!)ڇ:=by rw [ε] at c4;omega -splitDisjunctions have d5:(Yu bx bv b[j]!)ڇ-(Yp bx bv b[j]!)ڇ<=122:=by rw [gt_iff_lt,ε,κ _ _ (η.mpr d4)] at c5 simp only [not_lt] at c5;exact c5 rw [hj,h9] at wl1;rw [h3,h7] at wh1 by_cases h63:Yu bx bv b[j]! - Yp bx bv b[j]!<=63 . rw [ة h63] have d6:(Yu bx bv b[j]!)ڇ-(Yp bx bv b[j]!)ڇ<=63:=by rw [η,κ _ _ (η.mpr d4)] at h63;exact h63 rw [YS6e X W (i*inW)ژ (j*inW)ژ inWژ _ _ _ _ (Yp bx bv b[j]!) _ b[j]! (λ t ht hm=>by rw [hh,hb] at hm ⊢;rw [he] at ht;exact ZQ wl1 wh1 d6 (h1 t ht) (h8 t ht) hm) inW.toUSizeڇ 0 0 0 0 0 ג] apply ZcA X W inW i j b[j]! (Yp bx bv b[j]!) _ _ _ _ hh hb he hd . intro t ht;exact (Zb X[i*inW+t]!).2.2.1 (by have:=(h1 t ht).2;omega) . intro t ht;exact (Zb W[j*inW+t]!).2.2.1 (by have:=(h8 t ht).2;omega) . exact c3 . exact λ t ht hm=>ZQ wl1 wh1 d5 (h1 t ht) (h8 t ht) hm . intro hm;have h0:δ b[j]!≠0:=λ h=>hm (by rw [h,ἲ]);have:=wl2 h0;have:=wh2 h0;clear hm h0 c1 c2 c3 c5 wl2 wh2;constructor <;> omega . exact Zaf X W b inW i j . rw [ب h63] apply ZcA X W inW i j b[j]! (Yp bx bv b[j]!) _ _ _ _ hh hb he hd . intro t ht;exact (Zb X[i*inW+t]!).2.2.1 (by have:=(h1 t ht).2;omega) . intro t ht;exact (Zb W[j*inW+t]!).2.2.1 (by have:=(h8 t ht).2;omega) . exact c3 . exact λ t ht hm=>ZQ wl1 wh1 d5 (h1 t ht) (h8 t ht) hm . intro hm;have h0:δ b[j]!≠0:=λ h=>hm (by rw [h,ἲ]);have:=wl2 h0;have:=wh2 h0;clear hm h0 c1 c2 c3 c5 wl2 wh2;constructor <;> omega . exact Zaf X W b inW i j . exact Zaf X W b inW i j lemma ZcC:YaV=linearSpec:=by funext rows inW outW relu X W b;unfold YaV linearSpec linearWith;rw [ZB _ _ _ rfl];congr 1;funext q;have hq:=q.isLt;have h0:0< outW:=by rcases ἒ outW with h | h . subst h;simp at hq . exact h have hi:qک/outW< rows:=ϡ (lt_of_lt_of_eq hq (Μ rows outW));have hj:qک%outW< outW:=Ρ _ h0;rw [Ze rows (λ i=>Yc X inW i) _ hi,Ze outW (λ j=>Yc W inW j) _ hj,ZcB] lemma ZaV (x y:FloatLib.Numerics.Dyadic) (h:(Ἆ x y).significand=0) : (Ἆ x y).negative=(x.negative&&y.negative):=by unfold Ἆ ύ ὺ at h ⊢;dsimp only at h ⊢;split_ifs at h ⊢ <;> simp_all lemma ZaW (d:FloatLib.Numerics.Dyadic) (h:d.significand=0):Ἑ Ϡ d=Ὠ Ϡ d.negative:=by rw [Model.roundDyadic_eq_roundDyadicImpl];unfold Model.roundDyadicImpl;rw [ة ד];unfold Model.ieeeRoundDyadicImpl;rw [ة (by simp [h])];cases d.negative <;> rfl lemma ZN (k:Nat):(2:ℚ)^((k:ℤ)-149)=2^k*2^(-149:ℤ):=by rw [sub_eq_add_neg,zpow_add₀ two_ne_zero,د] lemma ZcD (a b:ο) (ha:Ξ a≠255) (hb:Ξ b≠255):ϗ (Ἳ (ofW a) (ofW b))=Γ (sv a*2^γ a+sv b*2^γ b) (-149) (φ a&&φ b):=by rw [Model.Proof.add_eq_spec];simp only [Model.Spec.add,ofW,toDyadic_ofUInt32 a ha,toDyadic_ofUInt32 b hb];have h0:(Ἆ (decodeD a) (decodeD b)).toRat=((sv a*2^γ a+sv b*2^γ b:Int):ℚ)*2^(-149:ℤ):=by rw [Ἆ,ό,ἱ,ἱ,ZN,ZN] push_cast;ring by_cases hS:sv a*2^γ a+sv b*2^γ b=0 . have hz:(Ἆ (decodeD a) (decodeD b)).significand=0:=by simp_all rw [ZaW _ hz,ZaV _ _ hz,decodeD_negative,decodeD_negative,hS,finishWord_zero] . exact (finishWord_of_ne _ _ _ _ hS h0).symm @[inline] def Yl (w:ο):ו := if Ξ w=0 then (ὥ w)ڈ else (ὥ w)ڈ+0x800000 lemma Zs (w:ο):(Yl w)ڇ=δ w:=by have hf:=ὑ w;unfold Yl δ;split . simp . rw [ι,ϊ,show (0x800000:ו)ڇ=2^23 from rfl,ζ א] omega lemma ZcJ (m:ו) (neg:Bool) (hm:mڇ<2^63):Ym (if neg then 0-m else m)=if neg then -(mڇ:Int) else (mڇ:Int):=by cases neg . simp only [τ,ت,Ym];rw [ة hm];simp . simp only [ث,Ym];rw [ϧ,show (0:ו)ڇ=0 from rfl];by_cases h0:mڇ=0 . rw [h0];norm_num . have h1:(2^64-mڇ+0)%2^64=2^64-mڇ:=א rw [h1,ب א];omega lemma ZcK (x:ו):-2^63<= Ym x/\Ym x<2^63:=by have:=x.toNat_lt_size;simp only [ἶ] at this;unfold Ym;split <;> omega lemma ZaZ (x y:ו) (h1:-2^63<= Ym x+Ym y) (h2:Ym x+Ym y<2^63):Ym (x+y)=Ym x+Ym y:=by unfold Ym at h1 h2 ⊢;rw [ι];split_ifs at h1 h2 ⊢ <;> omega lemma ZcL (m:ו) (d:Nat) (hd:d<64) (h:mڇ*2^d<2^64):(m<< simp [ᾄ,Nat.cast_pow] lemma Zai (w:ο):(if φ w then -((Yl w)ڇ:Int) else ((Yl w)ڇ:Int))=sv w:=by rw [Zs];rfl lemma ZO:sv ϒ=2^23/\γ ϒ=126:=ד lemma Za0 (a b:ο) (e:Nat) (h:δ a*δ b≠0-> e<128):-2^175< sv a*sv b*2^e/\sv a*sv b*2^e<2^175:=by rw [<- Zn];have hM:=ZK a b;by_cases h0:δ a*δ b=0 . rw [h0];simp . have he:=h h0 have hb:((δ a*δ b:Nat):Int)*2^e<2^175:=by have h1:(δ a*δ b)*2^e<2^48*2^127:= Ε hM (ξ ב א) ה have h2:(2:Nat)^48*2^127=2^175:=ג rw [h2] at h1 exact_mod_cast h1 have h3:(0:Int)<=((δ a*δ b:Nat):Int)*2^e:=by grind split <;> constructor <;> nlinarith lemma ZcN (S e:Int) (n1 n2:Bool) (h:S≠0):Γ S e n1=Γ S e n2:=by simp [Γ,h] lemma ZcO (m1 m2 p q:ו):(m1≠0-> (if m1=0 then q else if m2=0 then p else if p<= q then p else q)<= p) /\ (m2≠0-> (if m1=0 then q else if m2=0 then p else if p<= q then p else q)<= q):=by grind @[inline] def Yal (a b c d:ο) (nz:Bool) (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ڇ:Int)-298) if r=0x100000000 then (if nz then 0x80000000 else 0) else rڨ else slow () lemma Za1 (a b c d:ο) (nz:Bool) (slow:Unit-> ο) (h9:slow ()=Γ (sv a*sv b*2^(γ a+γ b)+sv c*sv d*2^(γ c+γ d)) (-298) nz) : Yal a b c d nz slow=Γ (sv a*sv b*2^(γ a+γ b)+sv c*sv d*2^(γ c+γ d)) (-298) nz:=by unfold Yal;dsimp only;have ia:=Zg a;have ib:=Zg b;have ic:=Zg c;have id:=Zg d;have hp:(Yd a+Yd b)ڇ=γ a+γ b:=by rw [ι,Zf,Zf,ζ א] have hq:(Yd c+Yd d)ڇ=γ c+γ d:=by rw [ι,Zf,Zf,ζ א] have hc:(Yf a*Yf b)ڇ=δ a*δ b:=by rw [Ϛ,Zk,Zk];exact ζ (by have:=ZK a b;omega) have hd:(Yf c*Yf d)ڇ=δ c*δ d:=by rw [Ϛ,Zk,Zk];exact ζ (by have:=ZK c d;omega) have z1:Yf a*Yf b=0 ↔ δ a*δ b=0:=by rw [<- hc,<- θ];rfl have z2:Yf c*Yf d=0 ↔ δ c*δ d=0:=by rw [<- hd,<- θ];rfl obtain ⟨L1,L2⟩:=ZcO (Yf a*Yf b) (Yf c*Yf d) (Yd a+Yd b) (Yd c+Yd d) generalize hg:(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)=lo at L1 L2 ⊢ split . rename_i h6;have F1:δ a*δ b≠0-> loڇ<= γ a+γ b/\γ a+γ b< loڇ+128:=by intro h0;have hm:Yf a*Yf b≠0:=λ h=>h0 (z1.mp h);have h3:=L1 hm;have h1:Yd a+Yd b-lo<128:=by rcases h6.1 with h | h . exact absurd h hm . exact h rw [η,hp] at h3;rw [ε,κ _ _ (L1 hm),hp] at h1;simp at h1;omega have F2:δ c*δ d≠0-> loڇ<= γ c+γ d/\γ c+γ d< loڇ+128:=by intro h0;have hm:Yf c*Yf d≠0:=λ h=>h0 (z2.mp h);have h3:=L2 hm;have h1:Yd c+Yd d-lo<128:=by rcases h6.2 with h | h . exact absurd h hm . exact h rw [η,hq] at h3;rw [ε,κ _ _ (L2 hm),hq] at h1;simp at h1;omega obtain ⟨w2,w1,w0,k,e1,hk,hv⟩:=Zr 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ڇ:Int)-298);if r=0x100000000 then (if nz then (0x80000000:ז) else 0) else rڨ) ג F1 rw [e1];obtain ⟨v2,v1,v0,k',e2,hf,h8⟩:=Zr lo c d w2 w1 w0 k (λ v2 v1 v0 k' => let r:=YD v2 v1 v0 k' ((loڇ:Int)-298);if r=0x100000000 then (if nz then (0x80000000:ז) else 0) else rڨ) (by simp at hk;omega) F2 rw [e2];dsimp only;have h5:=Za0 a b (γ a+γ b-loڇ) (λ h0=>by have:=F1 h0;omega) have h4:=Za0 c d (γ c+γ d-loڇ) (λ h0=>by have:=F2 h0;omega) have ha:Yx 0 0 0=0:=rfl;rw [ha,show (0:ו)ڇ=0 from rfl] at hv;have hb:((Yx v2 v1 v0+k'ڇ:Nat):Int)%2^192=(sv a*sv b*2^(γ a+γ b-loڇ)+sv c*sv d*2^(γ c+γ d-loڇ))%2^192:=by rw [h8];push_cast at hv ⊢;rw [Int.add_emod,hv,<- Int.add_emod];simp rw [ZV v2 v1 v0 k' _ _ (by linarith [h5.1,h4.1]) (by linarith [h5.2,h4.2]) hb];have hS:sv a*sv b*2^(γ a+γ b)+sv c*sv d*2^(γ c+γ d)=(sv a*sv b*2^(γ a+γ b-loڇ)+sv c*sv d*2^(γ c+γ d-loڇ))*2^loڇ:=by have e1:=ZC (sv a*sv b) (γ a+γ b) loڇ (by by_cases h0:δ a*δ b=0 . left;rw [<- Zn,h0];simp . right;exact (F1 h0).1) have e2:=ZC (sv c*sv d) (γ c+γ d) loڇ (by by_cases h0:δ c*δ d=0 . left;rw [<- Zn,h0];simp . right;exact (F2 h0).1) rw [e1,e2];ring by_cases hz:sv a*sv b*2^(γ a+γ b-loڇ)+sv c*sv d*2^(γ c+γ d-loڇ)=0 . rw [ة hz,ة rfl,hS,hz,zero_mul];cases nz <;> rfl . rw [ب hz];have h7:(Γ (sv a*sv b*2^(γ a+γ b-loڇ)+sv c*sv d*2^(γ c+γ d-loڇ)) ((loڇ:Int)-298) false)ڈ ≠0x100000000:=by intro h;have h2:=ص Ἀ h;rw [ϊ] at h2;have:=ώ (Γ (sv a*sv b*2^(γ a+γ b-loڇ)+sv c*sv d*2^(γ c+γ d-loڇ)) ((loڇ:Int)-298) false) simp only [UInt32.size] at this;simp at h2;omega rw [ب h7,UInt32.toUInt32_toUInt64,hS,show ((loڇ:Int)-298)=-298+(loڇ:Int) by ring,Ϻ] apply ZcN;intro h;apply hz;have he:(2:Int)^loڇ≠0:=pow_ne_zero _ two_ne_zero;exact (mul_eq_zero.mp h).resolve_right he . exact h9 @[inline] def Y1 (ma mb:ו) (ia ib:Nat):Nat := if ma=0 then ib else if mb=0 then ia else min ia ib lemma Za2 (ma mb:ו) (ia ib:Nat):(ma=0\/Y1 ma mb ia ib<= ia)/\(mb=0\/Y1 ma mb ia ib<= ib):=by unfold Y1;refine ⟨?_,?_⟩ <;> split_ifs <;> first | (left;assumption) | (right;omega) @[inline] def YaW (sa:Bool) (ma:ו) (ia:Nat) (sb:Bool) (mb:ו) (ib:Nat) (sh:Int) (nz:Bool) (slow:Unit-> ο):ο := let k:=Y1 ma mb ia ib let da:=ia-k let db:=ib-k if da<=38/\db<=38 then let ta:=ma<< ο) (h5:maڇ<2^24) (h0:mbڇ<2^24) (h6:slow ()=Γ ((if sa then -(maڇ:Int) else maڇ)*2^ia+(if sb then -(mbڇ:Int) else mbڇ)*2^ib) sh nz) : YaW sa ma ia sb mb ib sh nz slow=Γ ((if sa then -(maڇ:Int) else maڇ)*2^ia+(if sb then -(mbڇ:Int) else mbڇ)*2^ib) sh nz:=by unfold YaW;dsimp only;split . rename_i hd;obtain ⟨h8,h7⟩:=Za2 ma mb ia ib;set k:=Y1 ma mb ia ib;have hA:=ZY ma (ia-k) sa (by omega -splitDisjunctions) (by calc maڇ*2^(ia-k)<2^24*2^38:= Ε h5 (ξ ב hd.1) ה _=2^62:=ב) have hB:=ZY mb (ib-k) sb (by omega -splitDisjunctions) (by calc mbڇ*2^(ib-k)<2^24*2^38:= Ε h0 (ξ ב hd.2) ה _=2^62:=ב) have h9:=ZcK (if sa then 0-(ma<<<(ia-k)ڈ) else ma<<<(ia-k)ڈ);rw [ZaL,ZaZ _ _ ?_ ?_,hA,hB] . rw [show ((k:Int)+sh)=sh+(k:Int) by ring,Ϻ];congr 1;have e1:=ZC (if sa then -(maڇ:Int) else maڇ) ia k (by rcases h8 with h | h . left;subst h;simp . right;exact h) have e2:=ZC (if sb then -(mbڇ:Int) else mbڇ) ib k (by rcases h7 with h | h . left;subst h;simp . right;exact h) rw [e1,e2];ring . rw [hA,hB] have h1:(maڇ*2^(ia-k):Int)<2^62:=by exact_mod_cast (by calc maڇ*2^(ia-k)<2^24*2^38:= Ε h5 (ξ ב hd.1) ה _=2^62:=ב) have h2:(mbڇ*2^(ib-k):Int)<2^62:=by exact_mod_cast (by calc mbڇ*2^(ib-k)<2^24*2^38:= Ε h0 (ξ ב hd.2) ה _=2^62:=ב) have h3:(0:Int)<= maڇ*2^(ia-k):=ג have h4:(0:Int)<= mbڇ*2^(ib-k):=ג cases sa <;> cases sb <;> simp <;> nlinarith . rw [hA,hB] have h1:(maڇ*2^(ia-k):Int)<2^62:=by exact_mod_cast (by calc maڇ*2^(ia-k)<2^24*2^38:= Ε h5 (ξ ב hd.1) ה _=2^62:=ב) have h2:(mbڇ*2^(ib-k):Int)<2^62:=by exact_mod_cast (by calc mbڇ*2^(ib-k)<2^24*2^38:= Ε h0 (ξ ב hd.2) ה _=2^62:=ב) have h3:(0:Int)<= maڇ*2^(ia-k):=ג have h4:(0:Int)<= mbڇ*2^(ib-k):=ג cases sa <;> cases sb <;> simp <;> nlinarith . exact h6 @[inline] def YaX (a b:ο):ο := if Ξ a=255\/Ξ b=255 then ϗ (Ἳ (ofW a) (ofW b)) else YaW (φ a) (Yl a) (γ a) (φ b) (Yl b) (γ b) (-149) (φ a&&φ b) (λ _=>Yal a ϒ b ϒ (φ a&&φ b) (λ _=>ϗ (Ἳ (ofW a) (ofW b)))) lemma ZcQ (a b:ο):YaX a b=ϗ (Ἳ (ofW a) (ofW b)):=by unfold YaX;split . rfl . rename_i h;have ha:Ξ a≠255:=λ h'=>h (Or.inl h');have hb:Ξ b≠255:=λ h'=>h (Or.inr h');have hS:=ZcD a b ha hb;have h2:ϗ (Ἳ (ofW a) (ofW b))=Γ (sv a*sv ϒ*2^(γ a+γ ϒ)+sv b*sv ϒ*2^(γ b+γ ϒ)) (-298) (φ a&&φ b):=by rw [hS,ZO.1,ZO.2,show (-149:Int)=-298+((149:Nat):Int) by norm_num,Ϻ] congr 1;rw [ز,ز];ring have hT:Yal a ϒ b ϒ (φ a&&φ b) (λ _=>ϗ (Ἳ (ofW a) (ofW b)))=ϗ (Ἳ (ofW a) (ofW b)):=by rw [Za1 _ _ _ _ _ _ h2,h2] rw [<- Zai a,<- Zai b] at hS;rw [ZcP _ _ _ _ _ _ _ _ _ (by rw [Zs];exact Ω a) (by rw [Zs];exact Ω b) (by rw [hT];exact hS),hS] @[specialize] def YE (n:USize) (fx fw:(t:USize)-> t< n-> ο) (lo:ו) (e:Int) (bx bw:ז) (w2 w1 w0 c:ו) (k:USize):ו := if h:k< n then YL lo (fx k h) (fw k h) w2 w1 w0 c λ v2 v1 v0 c' => 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:Nat-> ο) (lo k:Nat):Nat-> Int | 0=>0 | r+1=>sv (fa k)*sv (fb k)*2^(γ (fa k)+γ (fb k)-lo)+Yr fa fb lo (k+1) r lemma Za5 (n:USize) (fx fw:(t:USize)-> t< n-> ο) (Yi fwN:Nat-> ο) (h9:∀ t h,fx t h=Yi tڇ) (he:∀ t h,fw t h=fwN tڇ) (lo:ו) (e:Int) (bx bw:ז) (hn:nڇ<2^32) (hb:δ bx*δ bw≠0-> loڇ<= γ bx+γ bw/\γ bx+γ bw< loڇ+128) : ∀ (d:Nat) (k:USize) (w2 w1 w0 c:ו) (S0 S:Int),nڇ-kڇ=d-> kڇ<= nڇ-> cڇ<= kڇ -> (∀ t,kڇ<= t-> t< nڇ-> δ (Yi t)*δ (fwN t)≠0-> loڇ<= γ (Yi t)+γ (fwN t)/\γ (Yi t)+γ (fwN t)< loڇ+128) -> ((Yx w2 w1 w0+cڇ:Nat):Int)%2^192=S0%2^192 -> S=S0+Yr Yi fwN loڇ kڇ (nڇ-kڇ)+sv bx*sv bw*2^(γ bx+γ bw-loڇ) -> -2^191<= S-> S<2^191 -> YE n fx fw lo e bx bw w2 w1 w0 c k=if S=0 then 0x100000000 else (Γ S e false)ڈ:=by intro d induction d with | zero => intro k w2 w1 w0 c S0 S hd hk hc h5 hv hS h6 h7 have h0:¬ k< n:=by rw [υ];omega rw [YE,dif_neg h0] obtain ⟨v2,v1,v0,c',h3,ha,h4⟩:=Zr lo bx bw w2 w1 w0 c (λ v2 v1 v0 c'=>YD v2 v1 v0 c' e) א hb rw [h3];apply ZV v2 v1 v0 c' e S h6 h7;rw [h4,hS,show nڇ-kڇ=0 by omega,Yr];omega | succ d ih => intro k w2 w1 w0 c S0 S hd hk hc h5 hv hS h6 h7 have h0:k< n:=by rw [υ];omega have h8:(k+1).toNat=k.toNat+1:=by rw [Zc _ _ (by have:=ϣ n;simp;omega),ϸ] rw [YE,dif_pos h0,h9,he] obtain ⟨v2,v1,v0,c',h3,ha,h4⟩:=Zr lo (Yi kڇ) (fwN kڇ) w2 w1 w0 c (λ v2 v1 v0 c'=>YE n fx fw lo e bx bw v2 v1 v0 c' (k+1)) א (h5 kڇ (le_refl _) א) rw [h3] refine ih (k+1) v2 v1 v0 c' (S0+sv (Yi kڇ)*sv (fwN kڇ)*2^(γ (Yi kڇ)+γ (fwN kڇ)-loڇ)) S א א א (λ t h1 h2=>h5 t א h2) ?_ ?_ h6 h7 . rw [h4];omega . rw [hS,show n.toNat-k.toNat=(n.toNat-(k+1).toNat)+1 by omega,Yr,h8];ring lemma Zaj (fa fb:Nat-> ο) (lo:Nat):∀ (r k:Nat),(∀ t,k<= t-> t< k+r-> δ (fa t)*δ (fb t)≠0-> lo<= γ (fa t)+γ (fb t)/\γ (fa t)+γ (fb t)<= lo+122) -> -((r:Int)*2^170)<= Yr fa fb lo k r/\Yr fa fb lo k r<=(r:Int)*2^170:=by intro r;induction r with | zero=>intro k _;simp [Yr] | succ r ih => intro k h;obtain ⟨a1,a2⟩:=ZL (fa k) (fb k) lo (h k (le_refl _) א);obtain ⟨b1,b2⟩:=ih (k+1) (λ t h1 h2=>h t א א);rw [Yr];push_cast;constructor <;> linarith lemma Z0 (wts:Array ο) (o k:Nat) (h:o*k+k<= wtsڑ/\o*k+k<=4294967295) (t:USize) (ht:t< kژ) : ((o*k)ژ+t)ڇ=o*k+tڇ/\o*k+tڇ< wtsڑ:=by have h0:k.toUSizeڇ=k:=Za _ א have h1:tڇ< k:=by rw [υ,h0] at ht;exact ht have hp:(o*k).toUSizeڇ=o*k:=Za _ א refine ⟨?_,by omega⟩ rw [Zc _ _ (by rw [hp];have:=Ϧ;omega),hp] lemma Zt (A B C q:Nat) (hq:q< A*(B*C)):q/C%B< B/\q%C< C/\q/(B*C)< A:=by have h0:0< B*C:=by rcases ἒ (B*C) with h | h . rw [h,ἲ] at hq;omega . exact h have hB:0< B:=Nat.pos_of_mul_pos_right h0;have hC:0< C:=Nat.pos_of_mul_pos_left h0;exact ⟨Ρ _ hB,Ρ _ hC,ϡ (by rwa [Μ] at hq)⟩ lemma ZcX (fa fb:Nat-> ο) (lo:Nat):∀ r k,(∀ t,k<= t-> t< k+r-> δ (fa t)*δ (fb t)≠0-> lo<= γ (fa t)+γ (fb t)) -> Yo fa fb k r=2^lo*Yr fa fb lo k r:=by intro r;induction r with | zero=>intro k _;simp [Yo,Yr] | succ r ih => intro k h;rw [Yo,Yr,ih (k+1) (λ t h1 h2=>h t א א), ZA _ _ lo (h k (le_refl _) א)] ring lemma ZgY (K:Nat) (Yi fwN:Nat-> ο) (lo:ו) (hK:K<1048576) (h7:∀ t,t< K-> Ξ (Yi t)≠255) (h9:∀ t,t< K-> Ξ (fwN t)≠255) (h1:∀ t,t< K-> δ (Yi t)*δ (fwN t)≠0-> loڇ<= γ (Yi t)+γ (fwN t)/\γ (Yi t)+γ (fwN t)<= loڇ+122) (FB:ο) (hf:FB=Ἰ K Yi fwN) (r:ו) (hr:r=if Yr Yi fwN loڇ 0 K=0 then 0x100000000 else (Γ (Yr Yi fwN loڇ 0 K) ((loڇ:Int)-298) false)ڈ) : (if r<0x100000000 then rڨ else FB)=Ἰ K Yi fwN:=by have hh:=Zaj Yi fwN loڇ K 0 (λ t _ h2 h3=>h1 t א h3) generalize h5:Yr Yi fwN loڇ 0 K=Srel at hr hh rw [hr];have hb:Ἰ K Yi fwN=Γ (Srel*2^loڇ) (-298) (decide (K≠0)&&Yq Yi fwN 0 K):=by rw [Zy K Yi fwN (λ t ht=>⟨h7 t ht,h9 t ht⟩)];congr 1;rw [ZcX Yi fwN loڇ K 0 (λ t _ h2 h3=>(h1 t א h3).1),<- h5];ring by_cases h0:Srel=0 . rw [ة h0,ب ד,hf] . rw [ب h0];have h6:(Γ Srel ((loڇ:Int)-298) false)ڈ<0x100000000:=by have:(Γ Srel ((loڇ:Int)-298) false)ڇ<2^32:= ώ _ rw [ε];simpa using this rw [ة h6,hb,<- Ϻ];have e1:(Γ Srel ((loڇ:Int)-298) false).toUInt64ڨ=Γ Srel ((loڇ:Int)-298) false:=by apply Η.mp;simp rw [e1];unfold Γ;rw [ب h0,ب h0,show (-298:Int)+(loڇ:Int)=(loڇ:Int)-298 by ring] lemma ZcY (K:Nat) (fx fw:(t:USize)-> t< Kژ-> ο) (Yi fwN:Nat-> ο) (ha:∀ t h,fx t h=Yi tڇ) (he:∀ t h,fw t h=fwN tڇ) (lo:ו) (hK:K<1048576) (h7:∀ t,t< K-> Ξ (Yi t)≠255) (h9:∀ t,t< K-> Ξ (fwN t)≠255) (h1:∀ t,t< K-> δ (Yi t)*δ (fwN t)≠0-> loڇ<= γ (Yi t)+γ (fwN t)/\γ (Yi t)+γ (fwN t)<= loڇ+122) (FB:ο) (hf:FB=Ἰ K Yi fwN) : (if YE Kژ fx fw lo ((loڇ:Int)-298) 0 0 0 0 0 0 0<0x100000000 then (YE Kژ fx fw lo ((loڇ:Int)-298) 0 0 0 0 0 0 0)ڨ else FB) = Ἰ K Yi fwN:=by have hh:=Zaj Yi fwN loڇ K 0 (λ t _ h2 h3=>h1 t א h3) have h4:K.toUSizeڇ=K:=Za _ א apply ZgY K Yi fwN lo hK h7 h9 h1 FB hf exact Za5 Kژ fx fw Yi fwN ha he lo ((loڇ:Int)-298) 0 0 א (λ h=>absurd (by decide:δ (0:ז)*δ 0=0) h) K 0 0 0 0 0 0 _ (by simp [h4]) ג ג (λ t _ h2 h3=>by have:=h1 t א h3;exact ⟨this.1,by omega⟩) (by simp [Yx]) (by rw [h4];simp [show sv (0:ז)=0 by decide]) א א lemma Zbb (B:Array ο) (k n bk j:Nat) (h:(bk+k)*n<= Bڑ/\j< n/\Bڑ<=4294967295) (hk:k<1048576) (t:USize) (ht:t< kژ) : ((bk*n+j)ژ+t*nژ)ڇ=(bk+tڇ)*n+j /\ (bk+tڇ)*n+j< Bڑ:=by have h1:k.toUSizeڇ=k:=Za _ א have h3:tڇ< k:=by rw [υ,h1] at ht;exact ht have h0:(bk+tڇ)*n+j< Bڑ:=by calc (bk+tڇ)*n+j<(bk+tڇ)*n+n:=א _=(bk+tڇ+1)*n:=by ring _<=(bk+k)*n:=Α _ א _<= Bڑ:=h.1 have e1:(bk+tڇ)*n+j=(bk*n+j)+tڇ*n:=by ring have hb:(bk*n+j).toUSizeڇ=bk*n+j:=Za _ א have h2:n<=(bk+k)*n:=ᾃ n א have hn:n.toUSizeڇ=n:=Za _ א have hm:(t*nژ)ڇ=tڇ*n:=by simp exact ζ (by have:=Ϧ;rw [<- USize.size_eq_two_pow] at *;omega) refine ⟨?_,h0⟩;rw [Zc _ _ (by rw [hb,hm];have:=Ϧ;omega),hb,hm,e1] @[noinline] def Yan (A B:Array ο) (k n r bk j:Nat):ο := Yn k (λ t=>A[r*k+t]!) (λ t=>B[(bk+t)*n+j]!) lemma Zam (A B:Array ο) (k n r bk j:Nat):Yan A B k n r bk j=Ἰ k (λ t=>A[r*k+t]!) (λ t=>B[(bk+t)*n+j]!):=by unfold Yan;rw [Zi] @[inline] def Ya2 (A B:Array ο) (k n r bk j:Nat) (ba bb:ז) (hk:k<1048576) : ο := if h:r*k+k<= Aڑ/\r*k+k<=4294967295/\((bk+k)*n<= Bڑ/\j< n /\ Bڑ<=4294967295) then let lo:=Yp ba bb 0 let hi:=Yu ba bb 0 if (ba&&&0xFFFF)=255||(bb&&&0xFFFF)=255||hi< lo||hi-lo > 122 then Yan A B k n r bk j else let r':=YE kژ (λ t ht=>A.uget ((r*k)ژ+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)ژ+t*nژ) (by have:=Zbb B k n bk j h.2.2 hk t ht rw [this.1];exact this.2)) lo ((loڇ:Int)-298) 0 0 0 0 0 0 0 if r'<0x100000000 then r'ڨ else Yan A B k n r bk j else Yan A B k n r bk j lemma ZcZ (A B:Array ο) (k n r bk j:Nat) (hk:k<1048576):Ya2 A B k n r bk j (Yc A k r) (Yc B Bڑ 0) hk=Ἰ k (λ t=>A[r*k+t]!) (λ t=>B[(bk+t)*n+j]!):=by unfold Ya2;split . rename_i hg;obtain ⟨Lx,Hx,h6,hd,hh,h0⟩:=Zp A k r hg.1 hg.2.1;obtain ⟨Lv,Hv,h4,hi,hf,h9⟩:=Zp B Bڑ 0 א א;generalize Yc A k r=bx at h6 ⊢;generalize Yc B Bڑ 0=bv at h4 ⊢;obtain ⟨hb,h3⟩:=Zo bx Lx Hx h6 א;obtain ⟨ha,h8⟩:=Zo bv Lv Hv h4 א;obtain ⟨wl1,-⟩:=Zad bx bv 0;obtain ⟨wh1,-⟩:=Zae bx bv 0;dsimp only;split . exact Zam A B k n r bk j . rename_i hc;have c1:¬ (bx&&&0xFFFF)=255:=λ h=>hc (by simp [h]);have c2:¬ (bv&&&0xFFFF)=255:=λ h=>hc (by simp [h]);have c4:¬ Yu bx bv 0< Yp bx bv 0:=λ h=>hc (by simp [h]);have c5:¬ Yu bx bv 0-Yp bx bv 0 > 122:=λ h=>hc (by simp [h]);have d1:Hx≠255:=λ h=>c1 (Η.mp (by rw [h3,h];rfl));have d2:Hv≠255:=λ h=>c2 (Η.mp (by rw [h8,h];rfl));have d4:(Yp bx bv 0)ڇ<=(Yu bx bv 0)ڇ:=by rw [ε] at c4;omega have d5:(Yu bx bv 0)ڇ-(Yp bx bv 0)ڇ<=122:=by rw [gt_iff_lt,ε,κ _ _ (η.mpr d4)] at c5 simp only [not_lt] at c5;exact c5 rw [hb,ha] at wl1;rw [h3,h8] at wh1;have h5:∀ t,t< k-> (bk+t)*n+j< Bڑ:=by intro t ht calc (bk+t)*n+j<(bk+t)*n+n:=א _=(bk+t+1)*n:=by ring _<=(bk+k)*n:=Α _ א _<= Bڑ:=hg.2.2.1 have h2:∀ t,t< k-> B[(bk+t)*n+j]! =B[0*Bڑ+((bk+t)*n+j)]! :=ג have hkk:k.toUSizeڇ=k:=Za _ א apply ZcY k _ _ (λ t=>A[r*k+t]!) (λ t=>B[(bk+t)*n+j]!) _ _ (Yp bx bv 0) hk . intro t ht;exact (Zb _).2.2.1 (by have:=(h0 t ht).2;omega) . intro t ht;rw [h2 t ht];exact (Zb _).2.2.1 (by have:=(h9 _ (h5 t ht)).2;omega) . intro t ht hm;rw [h2 t ht] at hm ⊢;exact ZQ wl1 wh1 d5 (h0 t ht) (h9 _ (h5 t ht)) hm . exact Zam A B k n r bk j . intro t ht;obtain ⟨e1,e2⟩:=Z0 A r k ⟨hg.1,hg.2.1⟩ t ht;show A[((r*k)ژ+t)ڇ]=_;rw [<- ح A _ (by rw [e1];exact e2)];simp only [e1] . intro t ht;obtain ⟨e1,e2⟩:=Zbb B k n bk j hg.2.2 hk t ht;show B[((bk*n+j)ژ+t*nژ)ڇ]=_;rw [<- ح B _ (by rw [e1];exact e2)];simp only [e1] . exact Zam A B k n r bk j def Ya3 (batch m k n:Nat) (A B:Array ο):Array ο := if hk:k<1048576 then let bb:=Yc B Bڑ 0 let BA:Array ז:=ς (n:=batch*m) λ r=>Yc A k rک 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 batch m k n A B;unfold Ya3 gemmSpec;split . rename_i hk rw [ZB _ _ _ (ϋ _ _ _)] congr 1 funext q have g1:∀ v:Nat,v/n=v/(m*n)*m+v/n%m:=by intro v;rw [Μ m n,<- ϐ];exact (ἣ _ _).symm have g2:∀ v:Nat,v/n/m=v/(m*n):=by intro v;rw [ϐ,Μ n m] rw [g2 qک];conv_lhs => rw [g1 qک] obtain ⟨hi,hj,hb⟩:=Zt batch m n qک q.isLt have hr:qک/(m*n)*m+qک/n%m< batch*m:=by calc qک/(m*n)*m+qک/n%m< qک/(m*n)*m+m:=א _=(qک/(m*n)+1)*m:=by ring _<= batch*m:=Α _ א rw [Ze (batch*m) (λ r=>Yc A k r) _ hr];exact ZcZ A B k n _ _ _ hk . 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:Int):bpow e=(2:ℝ)^e:=by simp [bpow,Ὡ,binaryRadix,Radix.toReal] lemma cW (w:ז):ϗ (NativeBinary32.ofUInt32 w)=w:=by simp only [ϗ,NativeBinary32.ofUInt32,toNatBits,ofBits];exact Ὓ lemma cU {a b:Int} {v:ℝ} (h1:bpow a<=v) (h2:v roundQuotientEven (scaleByPowerOfTwo n d x).1 (scaleByPowerOfTwo n d x).2= roundQuotientEven (scaleByPowerOfTwo n' d' x').1 (scaleByPowerOfTwo n' d' x').2:=λ x x' h=>by apply roundQuotientEven_eq_of_rat_eq _ _ _ _ (scaleByPowerOfTwo_snd_ne_zero _ _ _ hd) (scaleByPowerOfTwo_snd_ne_zero _ _ _ h0);rw [scaleByPowerOfTwo_real,scaleByPowerOfTwo_real];simp only [scaledRatToReal];rwa [ع,<- bpow_add,ع,<- bpow_add,add_sub_cancel,add_sub_cancel] at h rw [roundRatScaled_false_eq_of_isIEEE f n d e hf hn hd,roundRatScaled_false_eq_of_isIEEE f n' d' e' hf h5 h0];simp only [];rw [hQ _ (e'+ἃ (FloatFormat.subnormalAlignExp f)) (by rw [hv];ring_nf),hQ _ (ἃ f.fracWidth-floorLog2 n' d') (by rw [hv,show ἃ f.fracWidth-floorLog2 n d-e=ἃ f.fracWidth-floorLog2 n' d'-e' by omega]),hT] lemma Zbd (Q:ℚ) (s:Bool) (N D:Nat) (E:Int) (hD:0 0simp_all obtain rfl:Q=0:=by simp [hQ] simp [roundRatScaled_num_zero _ _ _ _ hD.ne'];rfl have hv:(0:ℚ)simp [neg_div] have h0:Q.numڭ≠0:=by simpa using (show Q≠0 by rw [hQ];cases s<;>simp [hv.ne']) have hR:(0:ℝ)push_cast<;>simp [abs_of_pos hR] rw [show decide (Q<0)=s by rw [hQ];cases s<;>simp [hv,not_lt.mpr hv.le]];cases s . exact cV _ hf _ _ _ _ _ _ h0 Q.den_nz hN hD.ne' h1 . rw [roundRatScaled_true_eq_neg_false _ _ _ _ hf Q.den_nz,roundRatScaled_true_eq_neg_false _ _ _ _ hf hD.ne',cV _ hf _ _ _ _ _ _ h0 Q.den_nz hN hD.ne' h1] lemma Zc1 (q u D r:Nat) (hu:2<= u) (he:u%2=0) (hr:0< r) (h0:r< D):roundQuotientEven (q*D+r) (D*u)=roundQuotientEven (2*q+1) (2*u):=by have hD:0< D:=א have e1:(q*D+r)/D=q:=by rw [Μ,Nat.mul_add_div hD,϶ h0,ὣ] have e2:(q*D+r)%D=r:=by rw [Μ,Nat.mul_add_mod,ζ h0] have h1:(q*D+r)/(D*u)=q/u:=by rw [<- ϐ,e1] have h2:(q*D+r)%(D*u)=r+D*(q%u):=by rw [Nat.mod_mul,e2,e1] have h3:(2*q+1)/(2*u)=q/u:=by rw [<- ϐ];congr 1;omega have h4:(2*q+1)%(2*u)=1+2*(q%u):=by rw [Nat.mod_mul,show (2*q+1)%2=1 by omega,show (2*q+1)/2=q by omega] unfold roundQuotientEven;simp only [h1,h2,h3,h4];generalize q%u=a at * by_cases hc:2*a+2<= u . have:D*(2*a+2)<= D*u:=ϥ _ hc have hl:2*(r+D*a)< D*u:=by grind have:2*(1+2*a)<2*u:=א simp [hl,this] . have h5:u<=2*a:=א have:D*u<= D*(2*a):=ϥ _ h5 have hl:D*u<2*(r+D*a):=by grind have:¬ 2*(r+D*a)< D*u:=א have:¬ 2*(1+2*a)<2*u:=א have:2*u<2*(1+2*a):=א simp [*] lemma Zbe (n d n' d':Nat) (x:Int) (hd:d≠0) (h0:d'≠0) (hv:(n':ℝ)/d'=n/d*bpow x):roundQuotientEven (scaleByPowerOfTwo n d x).1 (scaleByPowerOfTwo n d x).2=roundQuotientEven n' d':=by apply roundQuotientEven_eq_of_rat_eq _ _ _ _ (scaleByPowerOfTwo_snd_ne_zero _ _ _ hd) h0;rw [scaleByPowerOfTwo_real,hv];rfl lemma Zh (q D r m:Nat) (x y:Int) (hm:1<= m) (hx:x=-(m:ℤ)-1) (hy:y=-(m:ℤ)) (hr:0< r) (h0:r< D):roundQuotientEven (scaleByPowerOfTwo (2*q+1) 1 x).1 (scaleByPowerOfTwo (2*q+1) 1 x).2 = roundQuotientEven (scaleByPowerOfTwo (D*q+r) D y).1 (scaleByPowerOfTwo (D*q+r) D y).2:=by subst hx hy have hD:D≠0:=א have v1:(((2*q+1:ℕ)):ℝ)/((2*2^m:ℕ):ℝ)=((2*q+1:ℕ):ℝ)/((1:ℕ):ℝ)*bpow (-(m:ℤ)-1):=by rw [bz,show (-(m:ℤ)-1)=-((m+1:ℕ):ℤ) by push_cast;ring,zpow_neg,د,pow_succ] push_cast;field_simp have v2:(((q*D+r:ℕ)):ℝ)/((D*2^m:ℕ):ℝ)=((D*q+r:ℕ):ℝ)/(D:ℝ)*bpow (-(m:ℤ)):=by rw [bz,zpow_neg,د];push_cast;field_simp rw [Zbe _ _ _ _ _ one_ne_zero ה v1,Zbe _ _ _ _ _ hD ה v2];refine (Zc1 q (2^m) D r ?_ ?_ hr h0).symm . calc 2=2^1:=ב _<=2^m:=ξ ב hm . obtain ⟨k,rfl⟩:∃ k,m=k+1:=⟨m-1,by omega⟩;simp [pow_succ,Nat.mul_mod_left] lemma fl (q D r:Nat) (hq:1<= q) (hr:0< r) (h0:r< D):floorLog2 (D*q+r) D=qڕ/\floorLog2 (2*q+1) 1=qڕ+1:=by have hD:D≠0:=א have k1:=ϕ (show q≠0 by omega) have k2:=ϔ (n:=q) obtain ⟨b1,b2⟩:=floorLog2_bounds (D*q+r) D ה hD obtain ⟨b3,b4⟩:=floorLog2_bounds (2*q+1) 1 א one_ne_zero have hx:((D*q+r:ℕ):ℝ)/D=q+r/D:=by push_cast;field_simp have h1:(r:ℝ)/D<1:=by rw [div_lt_one ה];exact_mod_cast h0 have h2:(0:ℝ)< r/D:=div_pos (by exact_mod_cast hr) (by exact_mod_cast Ο hD) have c1:(2:ℝ)^qڕ<= q:=by exact_mod_cast k1 have c2:(q:ℝ)+1<=2^(qڕ+1):=by exact_mod_cast k2 constructor . refine cU b1 b2 (b:=(qڕ:ℤ)) ?_ ?_ . rw [bpow_natCast,hx];linarith . rw [show (qڕ:ℤ)+1=((qڕ+1:ℕ):ℤ) by push_cast;ring,bpow_natCast,hx];linarith . refine cU b3 b4 (b:=((qڕ+1:ℕ):ℤ)) ?_ ?_ |>.trans (by push_cast;ring) . 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 by ring,pow_succ];linarith lemma Zc3 (s:Bool) (N D:Nat) (E:Int) (hD:0< D) (hq:2^24<= N/D):NativeBinary32.roundRatScaled s (2*(N/D)+(if N%D=0 then 0 else 1)) 1 (E-1)=NativeBinary32.roundRatScaled s N D E:=by rw [<- cW (NativeBinary32.roundRatScaled s N D E),<- cW (NativeBinary32.roundRatScaled s _ 1 _),NativeBinary32.ofUInt32_roundRatScaled,NativeBinary32.ofUInt32_roundRatScaled] congr 1 have hf:FloatFormat.binary32.isIEEE=true:=ד have h2:=ἐ N D have h1:=Ρ N hD generalize N/D=q at hq h2 ⊢ generalize N%D=r at h2 h1 ⊢ subst h2 have h3:D*q+r≠0:=by have:=ϓ hD (show 0< q by omega);omega suffices H:roundRatScaled FloatFormat.binary32 false (2*q+if r=0 then 0 else 1) 1 (E-1)=roundRatScaled FloatFormat.binary32 false (D*q+r) D E by cases s . exact H . rw [roundRatScaled_true_eq_neg_false _ _ _ _ hf one_ne_zero,roundRatScaled_true_eq_neg_false _ _ _ _ hf hD.ne',H] by_cases h0:r=0 . subst h0;simp;apply cV _ hf _ _ _ _ _ _ א one_ne_zero h3 hD.ne';simp only [scaledRatToReal,bz];push_cast;rw [zpow_sub₀ (by norm_num:(2:ℝ)≠0)];field_simp;ring . simp only [h0,ت];obtain ⟨h5,h4⟩:=fl q D r א א h1;have hk:24<= qڕ:=(Ὄ א).2 hq;rw [roundRatScaled_false_eq_of_isIEEE _ _ _ _ hf א one_ne_zero,roundRatScaled_false_eq_of_isIEEE _ _ _ _ hf h3 hD.ne'] simp rw [h4,h5,show ((qڕ:ℕ):ℤ)+1+(E-1)=qڕ+E by ring] have hF:FloatFormat.binary32.fracWidth=23:=ד have hA:FloatFormat.subnormalAlignExp FloatFormat.binary32=149:=ד by_cases hS:E<= -151 . rw [Zh q D r ((-E-149).toNat) _ _ א ?_ ?_ א h1,Zh q D r (q.log2-23) _ _ א ?_ ?_ א h1] <;> simp [hA,hF] <;> omega . have:¬ ((qڕ:ℤ)+E< FloatFormat.binary32.minNormalExponent):=by rw [show FloatFormat.binary32.minNormalExponent=-126 by decide];omega simp only [this,ت];rw [Zh q D r (qڕ-23) _ _ א ?_ ?_ א h1] <;> simp [hF] <;> 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:ℚ) (num den:Nat) (e:Int) (hq:0< q) (h9:0< den) (h8:(num:ℚ)/den=q*(4:ℚ)^(-e)) (h7:2^23<= Ϣ num den) : ϗ (Ἱ Ϡ (roundWithAccuracy (FloatFormat.toModel Ϡ) .positive (Ϣ num den) e (ϴ num den)))=ἥ q:=by rw [sqrtRational_eq_math q];have h6:¬ q<=0:=not_le.mpr hq;have h1:Ϣ num den≠0:=by simp;omega have h0:=sqrtAccuracy_correct num den h9;have h2:e<=(FloatFormat.toModel Ϡ).targetExponent (Ϗ (Ϣ num den) e):=by change e<= max _ (-149) have hl:23<=(Ϣ num den)ڕ:=(Ὄ h1).mpr h7 have hb:((FloatFormat.toModel Ϡ).mantissaBits:Int)=24:=ד apply le_trans _ (le_max_left _ _) unfold Ϗ omega have he:=Model.cexp_accuracy_mul_bpow_eq_targetExponent Ϡ (Ϣ num den) e (ϴ num den) (Real.sqrt ((num:ℝ)/den)) ד h1 h0 have hs:=Model.scaledMantissa_accuracy_mul_bpow Ϡ (Ϣ num den) e (ϴ num den) (Real.sqrt ((num:ℝ)/den)) ד h1 h0 have hn:=Model.roundedMantissa_shiftToTargetExponent_eq_nearestEven Ϡ (Ϣ num den) e (ϴ num den) (Real.sqrt ((num:ℝ)/den)) h0 h2 have h5:Real.sqrt ((num:ℝ)/den)*bpow binaryRadix e=Real.sqrt (q:ℝ):=by have h4:(4:ℝ)^(-e)=((2:ℝ)^(-e))^2:=by rw [show (4:ℝ)=2*2 by norm_num,mul_zpow,sq] have hv:(num:ℝ)/den=(q:ℝ)*((2:ℝ)^(-e))^2:=by have:=ص (λ x:ℚ=>(x:ℝ)) h8;push_cast at this;rw [this,h4] rw [hv,Real.sqrt_mul (by exact_mod_cast hq.le),Real.sqrt_sq ה];simp only [bpow,binaryRadix,Radix.toReal] push_cast;rw [ع,<- zpow_add₀ (by norm_num:(2:ℝ)≠0)];simp rw [h5] at he hs;have ha:(nearestEven (scaledMantissa binaryRadix (Model.fexpOf Ϡ) (Real.sqrt (q:ℝ))))ڇ = (shiftToTargetExponent (FloatFormat.toModel Ϡ) (Ϣ num den) e (ϴ num den)).1.roundedMantissa:=by rw [hs,<- hn];simp have h3:(shiftToTargetExponent (FloatFormat.toModel Ϡ) (Ϣ num den) e (ϴ num den)).2=(FloatFormat.toModel Ϡ).targetExponent (Ϗ (Ϣ num den) e):=by rw [Model.shiftToTargetExponent_eq_of_le_targetExponent Ϡ _ e _ h2] simp only [sqrtMathWord,h6,ت,he,ha];rw [Model.roundWithAccuracy_eq_finishRoundedMantissa];rw [h3] end @[inline] def Y2 (x:Array ο) (base n:Nat):Nat := (Ἁ n).foldl (λ b j => let w:=x[base+j]! if δ w=0 then b else min b (γ w)) 255 @[inline] def Y6 (x:Array ο) (base n b0:Nat):Array Nat := (Ἁ n).foldl (λ a j => let w:=x[base+j]! Ϸ a (δ w*δ w)ڈ (2*(γ w-b0))) (Θ 18 0) @[inline] def Y7 (x:Array ο) (base n b0:Nat):Array Nat × Array Nat := (Ἁ n).foldl (λ pq j => let w:=x[base+j]! if φ w then (pq.1,Ϸ pq.2 (δ w)ڈ (γ w-b0)) else (Ϸ pq.1 (δ w)ڈ (γ w-b0),pq.2)) (Θ 18 0,Θ 18 0) @[inline] def sqA (num den root:Nat):Nat:= if num=root*root*den then 0 else if 4*num< den*((2*root+1)*(2*root+1)) then 1 else if 4*num=den*((2*root+1)*(2*root+1)) then 2 else 3 @[inline] def sqW (num den root:Nat) (e:Int):ο:= let sh:Nat:=if root<16777216 then 0 else 1 let x:Int:=e+sh+150 if 8388608<= root/\root<33554432/\0< den/\1<= x/\x<=253 then let r:=ν (4*root+sqA num den root) (if root<16777216 then 4 else 8) if r=16777216 then σ false (x+1).toNat 0 else σ false xڇ (r-8388608) else ϗ (Ἱ Ϡ (Ἐ (FloatFormat.toModel Ϡ) .positive root e (ϴ num den))) @[inline] def YaD (num0 m:Nat) (h:Int) (fallback:Unit-> ο):ο := let t:Int:=(47-(num0ڕ:Int)+mڕ+1)/2 let num:=if 0<= t then num0<<<(2*tڇ) else num0 let den:=if 0<= t then m else m<<<(2*(-t)ڇ) let root:=Ϣ num den if 8388608<= root then sqW num den root (h-t) else fallback () @[inline] def YF (b0 ie:Nat):Nat:=min (2*b0) (ie+149)/2*2 @[inline] def Y8 (x:Array ο) (n:Nat) (eps:ο) (r:Nat):Nat × Int × ο := let b0:=Y2 x (r*n) n let pq:=Y7 x (r*n) n b0 let S1:Int:=(Ϲ pq.1:Int)-Ϲ pq.2 let T:Int:=(n:Int)*Ϲ (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:Int)-298)/2) λ _ => ἥ (Ἅ n x r (Ϯ n x r)+ψ eps)) section open ExactRuntime FloatLib.Floats.Formats.BinaryInterchange FloatLib.Floats open Float.Model.UnpackedFloat lemma iB (w:ο):γ w<=254:=by have:=Ὗ w;unfold γ;split_ifs <;> omega lemma lS (m k:Nat-> Nat) (hm:∀ j,m j<2^64) (hk:∀ j,k j/32+1<18) (l:List Nat) (a:Array Nat) (ha: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 [ha] | cons j l ih => simp;obtain ⟨h1,h2⟩:=ih (Ϸ a (m j)ڈ (k j)) (by rw [ἷ];exact ha);refine ⟨h1,?_⟩;rw [h2,Ὀ _ _ _ (hm j),Ὑ _ _ _ (by rw [ha];exact hk j)];ring lemma lP (x:Array ο) (base b0:Nat) (f:Array Nat × Array Nat-> Nat-> Array Nat × Array Nat) (hf:∀ pq j,f pq j=if φ x[base+j]! then (pq.1,Ϸ pq.2 (δ x[base+j]!)ڈ (γ x[base+j]! - b0)) else (Ϸ pq.1 (δ x[base+j]!)ڈ (γ x[base+j]! - b0),pq.2)) (l:List Nat):∀ p q,pڑ=18-> qڑ=18-> (l.foldl f (p,q)).1.size=18 /\ (l.foldl f (p,q)).2.size=18/\((ϟ (l.foldl f (p,q)).1.toList:Int) - ϟ (l.foldl f (p,q)).2.toList)=(ϟ pڤ:Int)-ϟ qڤ+(l.map λ j=>sv x[base+j]!*2^(γ x[base+j]! - b0)).sum:=by induction l with | nil=>intro p q hp hq;simp [hp,hq] | cons j l ih => intro p q hp hq;simp only [ὅ,ὔ,ὓ,hf];have hm:=Ω x[base+j]!;have hi:=iB x[base+j]!;by_cases hs:φ x[base+j]! =true . simp only [hs,ث];obtain ⟨h1,h2,h3⟩:=ih p (Ϸ q (δ x[base+j]!)ڈ (γ x[base+j]! - b0)) hp (by rw [ἷ];exact hq) refine ⟨h1,h2,?_⟩;rw [h3,Ὀ _ _ _ א,Ὑ _ _ _ (by rw [hq];omega)];simp only [sv,hs,ث];push_cast;ring . simp only [hs,τ,ت];obtain ⟨h1,h2,h3⟩:=ih (Ϸ p (δ x[base+j]!)ڈ (γ x[base+j]! - b0)) q (by rw [ἷ];exact hp) hq refine ⟨h1,h2,?_⟩;rw [h3,Ὀ _ _ _ א,Ὑ _ _ _ (by rw [hp];omega)];simp only [sv,hs,τ,ت];push_cast;ring lemma fS (f:Nat-> ℚ) (l:List Nat) (a:ℚ):l.foldl (λ t j=>t+f j) a=a+(l.map f).sum:=by induction l generalizing a with | nil=>simp | cons j l ih=>simp [ὅ,ih,add_assoc] lemma sqA_acc (num den:Nat):ϴ num den=ὴ (sqA num den (Ϣ num den)) 4:=by unfold ϴ sqA;dsimp only;simp only [sq];split_ifs <;> rfl lemma rqB (N d:Nat):N/d<= ν N d /\ ν N d<= N/d+1:=by unfold ν;dsimp only;split_ifs <;> omega lemma sqP (r:Nat) (k:Int) (h1:8388608<= r) (h2:r<16777216) (hk:-126<= k) (hk2:k<=127) : ϗ (Ἱ Ϡ (ὧ (FloatFormat.toModel Ϡ) .positive (r,k-23)))=σ false (k+127).toNat (r-8388608):=by have hf:Ϡ.fracWidth=23:=ד have hp:ἠ Ϡ.fracWidth=8388608:=ד have hp1:ἠ (Ϡ.fracWidth+1)=16777216:=ד have hmin:FloatFormat.ieeeMinNormalExponent Ϡ=-126:=ד have hmax:ἃ (FloatFormat.ieeeMaxNormalExponent Ϡ)=127:=ד have hb:ἃ Ϡ.bias=127:=ד have e1:=Model.finishRoundedMantissa_normalized Ϡ .positive r k (by rw [hp];exact h1) (by rw [hp1];exact h2) (by rw [hmin];exact hk) rw [show (k-23:Int)=k-(Ϡ.fracWidth:Int) by rw [hf];rfl,e1] have e2:=Ἷ Ϡ false r k (by rw [hp];exact h1) (by rw [hp1];exact h2) (by rw [hmin];exact hk) (by rw [hmax];exact hk2) erw [e2] rw [hb,hp] have e4:ϗ (ϫ (σ false (k+127).toNat (r-8388608)))=σ false (k+127).toNat (r-8388608):=by simp only [ϗ,ϫ,ὤ,έ];exact Ὓ rw [Ἧ] at e4;exact e4 lemma sqC (k:Int) (hk:-126<= k) (hk2:k+1<=127) : ϗ (Ἱ Ϡ (ὧ (FloatFormat.toModel Ϡ) .positive (16777216,k-23)))=σ false (k+1+127).toNat 0:=by have hf:Ϡ.fracWidth=23:=ד have hp:ἠ Ϡ.fracWidth=8388608:=ד have hp1:ἠ (Ϡ.fracWidth+1)=16777216:=ד have hmin:FloatFormat.ieeeMinNormalExponent Ϡ=-126:=ד have hmax:ἃ (FloatFormat.ieeeMaxNormalExponent Ϡ)=127:=ד have hb:ἃ Ϡ.bias=127:=ד have e1:=Model.finishRoundedMantissa_normalized_carry Ϡ .positive k (by rw [hmin];exact hk) rw [show (k-23:Int)=k-(Ϡ.fracWidth:Int) by rw [hf];rfl,show (16777216:Nat)=ἠ (Ϡ.fracWidth+1) from hp1.symm,e1] have e2:=Ἷ Ϡ false (ἠ Ϡ.fracWidth) (k+1) le_rfl (by rw [hp,hp1];decide) (by rw [hmin];omega) (by rw [hmax];exact hk2) erw [e2] rw [hb,Nat.sub_self] have e4:ϗ (ϫ (σ false (k+1+127).toNat 0))=σ false (k+1+127).toNat 0:=by simp only [ϗ,ϫ,ὤ,έ];exact Ὓ rw [Ἧ] at e4;exact e4 theorem sqW_eq (num den:Nat) (e:Int):sqW num den (Ϣ num den) e=ϗ (Ἱ Ϡ (Ἐ (FloatFormat.toModel Ϡ) .positive (Ϣ num den) e (ϴ num den))):=by have hA:=sqA_acc num den unfold sqW generalize Ϣ num den=root at hA ⊢ have hmb:(FloatFormat.toModel Ϡ).mantissaBits=24:=ד have hme:(FloatFormat.toModel Ϡ).minExponent=-149:=ד by_cases hs:root<16777216 · simp only [hs,ث,ὖ,add_zero] split · rename_i hc obtain ⟨h23,h25,hd,hx1,hx2⟩:=hc have hlt:sqA num den root<4:=by unfold sqA;split_ifs <;> omega generalize sqA num den root=a at hA hlt ⊢ rw [hA] have key:=ἡ (FloatFormat.toModel Ϡ) .positive (4*root+a) 4 e ב rw [show (4*root+a)/4=root by omega,show (4*root+a)%4=a by omega] at key have hne:root≠0:=א have hl1:=(Ὄ hne).mpr (show 2^23<= root by omega) have hl2:=(ϩ hne).mpr (show root<2^24 by omega) have hsh:((FloatFormat.toModel Ϡ).targetExponent (Ϗ root e) - e)ڇ=0:=by simp only [Ἲ,Ϗ,hmb,hme];omega rw [key];dsimp only;rw [hsh];simp only [pow_zero,mul_one,ὖ,add_zero] obtain ⟨b1,b2⟩:=rqB (4*root+a) 4 generalize ν (4*root+a) 4=r at b1 b2 ⊢ split · rename_i hr;subst hr;rw [show e=(e+23)-23 by ring,sqC (e+23) א א];congr 2;omega · rw [show e=(e+23)-23 by ring,sqP r (e+23) א א א א];congr 2;omega · rfl · simp only [hs,ت,Nat.cast_one] split · rename_i hc obtain ⟨h23,h25,hd,hx1,hx2⟩:=hc have hlt:sqA num den root<4:=by unfold sqA;split_ifs <;> omega generalize sqA num den root=a at hA hlt ⊢ rw [hA] have key:=ἡ (FloatFormat.toModel Ϡ) .positive (4*root+a) 4 e ב rw [show (4*root+a)/4=root by omega,show (4*root+a)%4=a by omega] at key have hne:root≠0:=א have hl1:=(Ὄ hne).mpr (show 2^24<= root by omega) have hl2:=(ϩ hne).mpr (show root<2^25 by omega) have hsh:((FloatFormat.toModel Ϡ).targetExponent (Ϗ root e) - e)ڇ=1:=by simp only [Ἲ,Ϗ,hmb,hme];omega rw [key];dsimp only;rw [hsh];simp only [pow_one,Nat.cast_one] obtain ⟨b1,b2⟩:=rqB (4*root+a) (4*2) generalize ν (4*root+a) (4*2)=r at b1 b2 ⊢ split · rename_i hr;subst hr;rw [show e+1=(e+24)-23 by ring,sqC (e+24) א א];congr 2;omega · rw [show e+1=(e+24)-23 by ring,sqP r (e+24) א א א א];congr 2;omega · rfl lemma Zbg (num0 m:Nat) (h:Int) (q:ℚ) (hq:0< q) (hm:0< m) (hv:(num0:ℚ)/m*4^h=q):YaD num0 m h (λ _=>ἥ q)=ἥ q:=by unfold YaD;simp only [sqW_eq] generalize (47-((num0ڕ:Nat):Int)+(mڕ:Nat)+1)/2=t have e:∀ k:Nat,(2:ℚ)^(2*k)=4^(k:ℤ):=λ k=>by rw [pow_mul,د];norm_num by_cases h0:0<= t <;> simp only [h0,ث,ت] <;> split_ifs with hr <;> try rfl all_goals refine Zc4 q _ _ _ hq (by first | exact hm | (rw [π];exact ϓ hm ה)) ?_ (by rw [show (2:Nat)^23=8388608 by norm_num];exact hr) all_goals rw [<- hv,show -(h-t)=t-h by ring,zpow_sub₀ ב];simp only [π] all_goals push_cast;rw [e,ὕ א];field_simp [zpow_neg] all_goals rw [ع,<- zpow_add₀ ב];simp lemma Zc7 (w:ο):(sv w:ℚ)^2=(δ w:ℚ)^2:=by unfold sv;split_ifs <;> push_cast <;> ring lemma Zbh (eps:ο) (he:0< ψ eps):ψ eps=(δ eps:ℚ)*2^((γ eps:ℤ)-149):=by have h:=he;simp only [ψ,ἱ] at h ⊢;unfold sv at h ⊢;split_ifs at h ⊢ with hs . have:(0:ℚ)<=2^((γ eps:ℤ)-149):=ה push_cast at h;nlinarith [show (0:ℚ)<= δ eps by positivity] . push_cast;ring lemma Zbi (x:Array ο) (n r b0:Nat) (h1:∀ j< n,δ x[r*n+j]!≠0-> b0<= γ x[r*n+j]!) : (Ϲ (Y6 x (r*n) n b0):ℚ)*2^((2*b0:ℤ)-298)=((Ἁ n).map λ j=>(ψ x[r*n+j]!)^2).sum:=by unfold Y6;simp only [];rw [ὃ,(lS (λ j=>δ x[r*n+j]!*δ x[r*n+j]!) (λ j=>2*(γ x[r*n+j]! - b0)) (λ j=>by have:=Ω x[r*n+j]!;nlinarith) (λ j=>by have:=iB x[r*n+j]!;omega) _ _ ג).2] have h0:ϟ (Θ 18 0)ڤ=0:=ד rw [h0,س,Nat.cast_list_sum,ί,<- ὶ] congr 1;apply ὐ;intro j hj have h2:=Ὢ.1 hj simp only [Function.comp,ψ,ἱ] by_cases hm:δ x[r*n+j]! =0 . simp [hm,sv] . have hb:=h1 j h2 hm have hx:((2:ℚ)^((γ x[r*n+j]!:ℤ)-149))^2=(2:ℚ)^(2*(γ x[r*n+j]! - b0))*2^((2*b0:ℤ)-298):=by rw [<- د (2:ℚ) (2*(γ x[r*n+j]! - b0)),<- zpow_add₀ ב,<- د _ 2,<- zpow_mul] congr 1;push_cast [hb];ring rw [mul_pow,Zc7,hx];push_cast;ring lemma Zbj (x:Array ο) (n r b0:Nat) (h1:∀ j< n,δ x[r*n+j]!≠0-> b0<= γ x[r*n+j]!) : (((Ϲ (Y7 x (r*n) n b0).1:ℤ)-Ϲ (Y7 x (r*n) n b0).2:ℤ):ℚ)*2^((b0:ℤ)-149)=((Ἁ n).map λ j=>ψ x[r*n+j]!).sum:=by unfold Y7 rw [ὃ,ὃ,(lP x (r*n) b0 _ (λ _ _=>rfl) (Ἁ n) _ _ ג ג).2.2] have h0:ϟ (Θ 18 0)ڤ=0:=ד rw [h0];push_cast;rw [س,ί,<- ὶ] congr 1;apply ὐ;intro j hj simp only [Function.comp,ψ,ἱ];push_cast by_cases hm:δ x[r*n+j]! =0 . simp [hm,sv] . have hb:=h1 j (Ὢ.1 hj) hm rw [ع,<- د,<- zpow_add₀ ב];congr 2;push_cast [hb];ring lemma sm (f:Nat-> ℚ) (μ:ℚ) (l:List Nat):(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 with | nil=>simp | cons j l ih=>simp only [ὔ,ὓ,List.length_cons,ih];push_cast;ring lemma Z2 (x:Array ο) (base n j:Nat) (hj:j< n) (hm:δ x[base+j]!≠0):Y2 x base n<= γ x[base+j]!:=by suffices H:∀ (l:List Nat) (b:Nat),l.foldl (λ b j => if δ x[base+j]! =0 then b else min b (γ x[base+j]!)) b<= b /\ ∀ k ∈ l,δ x[base+k]!≠0-> l.foldl (λ b j => if δ x[base+j]! =0 then b else min b (γ x[base+j]!)) b<= γ x[base+k]! from (H _ 255).2 j (Ὢ.2 hj) hm intro l;induction l with | nil=>intro b;simp | cons a l ih => intro b;simp only [ὅ];obtain ⟨h1,h2⟩:=ih (if δ x[base+a]! =0 then b else min b (γ x[base+a]!));refine ⟨le_trans h1 (by split_ifs <;> omega),λ k hk h0 => ?_⟩;rcases List.mem_cons.1 hk with rfl | hk . exact le_trans h1 (by simp [h0]) . exact h2 k hk h0 lemma Zc9 (b0 ie:Nat):YF b0 ie<=2*b0/\YF b0 ie<= ie+149 /\ (4:ℚ)^(((YF b0 ie:ℤ)-298)/2)=2^((YF b0 ie:ℤ)-298):=by unfold YF;refine ⟨by omega,by omega,?_⟩;rw [show (4:ℚ)=2^(2:ℤ) by norm_num,<- zpow_mul];congr 1;omega lemma Zbk (A n b0 ie me:Nat) (hn:0< n):((A<<<(2*b0-YF b0 ie)+(n*me)<<<(ie+149-YF b0 ie):Nat):ℚ)/n*4^(((YF b0 ie:ℤ)-298)/2) = (A:ℚ)*2^((2*b0:ℤ)-298)/n+(me:ℚ)*2^((ie:ℤ)-149):=by obtain ⟨h1,h2,h4⟩:=Zc9 b0 ie;generalize YF b0 ie=c at h1 h2 h4;rw [h4];simp only [π];push_cast;rw [<- د (2:ℚ) (2*b0-c),<- د (2:ℚ) (ie+149-c)];push_cast [h1,h2];have e1:(2:ℚ)^((2*b0:ℤ)-298)=2^((2*b0:ℤ)-c)*2^((c:ℤ)-298):=by rw [<- zpow_add₀ ב];congr 1;ring have e2:(2:ℚ)^((ie:ℤ)-149)=2^((ie:ℤ)+149-c)*2^((c:ℤ)-298):=by rw [<- zpow_add₀ ב];congr 1;ring rw [e1,e2];field_simp lemma Zbl (n:Nat) (x:Array ο) (r:Nat) (μ:ℚ):0<= Ἅ n x r μ:=by unfold Ἅ;rw [fS (λ j=>(ψ x[r*n+j]! - μ)^2),س];exact div_nonneg (List.sum_nonneg λ a ha=>by obtain ⟨j,_,rfl⟩:=List.mem_map.1 ha;positivity) (Nat.cast_nonneg _) lemma Zdb (x:Array ο) (n:Nat) (eps:ο) (r:Nat) (hn:0< n) (he:0< ψ eps) : (Y8 x n eps r).2.2=ἥ (Ἅ n x r (Ϯ n x r)+ψ eps):=by refine Zbg _ _ _ _ (add_pos_of_nonneg_of_pos (Zbl _ _ _ _) he) (ϓ hn hn) ?_;have h1:∀ j< n,δ x[r*n+j]!≠0-> Y2 x (r*n) n<= γ x[r*n+j]!:=λ j hj hm=>Z2 x (r*n) n j hj hm have hS:=Zbi x n r _ h1;have hV:=Zbj x n r _ h1;have h0:=Zbl n x r (Ϯ n x r);rw [Zbh eps he];have hW:Ἅ n x r (Ϯ n x r)=(((Ἁ n).map λ j=>(ψ x[r*n+j]!)^2).sum - 2*Ϯ n x r*((Ἁ n).map λ j=>ψ x[r*n+j]!).sum + n*Ϯ n x r^2)/n:=by unfold Ἅ;rw [fS (λ j=>(ψ x[r*n+j]! - Ϯ n x r)^2),س,sm,List.length_range] have hM:Ϯ n x r=((Ἁ n).map λ j=>ψ x[r*n+j]!).sum/n:=by unfold Ϯ;rw [fS (λ j=>ψ x[r*n+j]!),س] generalize Y2 x (r*n) n=b0 at hS hV ⊢;generalize Ϲ (Y6 x (r*n) n b0)=A at hS ⊢;generalize ((Ϲ (Y7 x (r*n) n b0).1:ℤ)-Ϲ (Y7 x (r*n) n b0).2)=S1 at hV ⊢;have hv:Ἅ n x r (Ϯ n x r)=(((n:ℤ)*A-S1*S1:ℤ):ℚ)*((2:ℚ)^((2*b0:ℤ)-298)/(n*n)):=by rw [hW,hM,<- hS,<- hV,show (2:ℚ)^((2*b0:ℤ)-298)=(2^((b0:ℤ)-149))^2 by rw [<- د _ 2,<- zpow_mul];congr 1;ring] push_cast;field_simp;ring have hT:0<=(n:ℤ)*A-S1*S1:=by have:=h0;rw [hv] at this;exact_mod_cast nonneg_of_mul_nonneg_left this (div_pos ה (by exact_mod_cast ϓ hn hn)) rw [Zbk _ (n*n) b0 (γ eps) (δ eps) (ϓ hn hn),hv,show ((((n:ℤ)*A-S1*S1)ڇ:ℕ):ℚ)=(((n:ℤ)*A-S1*S1:ℤ):ℚ) by exact_mod_cast ὕ hT] push_cast;ring lemma Zdc (x:Array ο) (n:Nat) (eps:ο) (r:Nat) (hn:0< n):Ϯ n x r=((Y8 x n eps r).2.1:ℚ)*2^(((Y8 x n eps r).1:Int)-149)/n:=by unfold Ϯ Y8;simp only [];rw [fS (λ j=>ψ x[r*n+j]!),س,<- Zbj x n r _ (λ j hj hm=>Z2 x (r*n) n j hj hm)] end @[inline] def YaF (w:ο) (b:Nat):Int:=sv w<<<(γ w-b) @[inline] def elL (n:Nat) (w gw bw:ο) (b0:Nat) (S1:Int) (dw:ο) (mean:Unit-> ℚ):ο := if sv dw<=0 then ἰ ((ψ w-mean ())*ψ gw/ψ dw+ψ bw) else let c2:=min (b0+γ gw) (γ bw+γ dw) let P:=((n:Int)*YaF w b0-S1)*sv gw<<<(b0+γ gw-c2) + (n:Int)*sv bw*sv dw<<<(γ bw+γ dw-c2) ἳ (P<0) Pڭ (n*δ dw) ((c2:Int)-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 hs:φ d=false:=by by_contra c;simp at c;exact h (by simp [sv,c]) have:sv d=δ d:=by simp [sv,hs] exact ⟨this,by omega⟩ lemma eP (P:ℤ):(if decide (P<0)=true then -((Pڭ:ℕ):ℚ) else (Pڭ:ℚ))=P:=by rw [Nat.cast_natAbs];split_ifs with c <;> simp at c . rw [abs_of_neg (by exact_mod_cast c)];push_cast;ring . rw [abs_of_nonneg (by exact_mod_cast c)] lemma Zde (n:Nat) (w gw bw:ο) (b0:Nat) (S1:Int) (dw:ο) (mean:Unit-> ℚ) (hn:0< n) (h0:δ w≠0-> b0<= γ w) (h1:mean ()=(S1:ℚ)*2^((b0:Int)-149)/n) : elL n w gw bw b0 S1 dw mean=ἰ ((ψ w-mean ())*ψ gw/ψ dw+ψ bw):=by unfold elL;split_ifs with h;· rfl obtain ⟨hv,hD⟩:=eD dw h refine (Zbd _ _ _ _ _ (ϓ hn hD) (λ p=>by simp at p;omega) ?_).symm simp only [ψ,ἱ,h1];rw [eP] generalize hc:min (b0+γ gw) (γ bw+γ dw)=c have k1:c<= b0+γ gw:=hc▸min_le_left _ _;have k2:c<= γ bw+γ dw:=hc▸min_le_right _ _ simp only [YaF,ὁ,hv];push_cast have h2:(2:ℚ)≠0:=ג have hx:(sv w:ℚ)*2^((γ w:ℤ)-149)=sv w*2^(γ w-b0)*2^((b0:ℤ)-149):=by by_cases m:δ w=0;· simp [sv,m] rw [ع,<- د,<- zpow_add₀ h2];congr 2;push_cast [h0 m];ring have hB:(2:ℚ)^((b0:ℤ)-149)*2^((γ gw:ℤ)-149)=2^((c:ℤ)-149-γ dw)*2^((γ dw:ℤ)-149)*2^(b0+γ gw-c):=by rw [<- د,<- zpow_add₀ h2,<- zpow_add₀ h2,<- zpow_add₀ h2];congr 1;push_cast [k1];ring have hI:(2:ℚ)^((γ bw:ℤ)-149)=2^((c:ℤ)-149-γ dw)*2^(γ bw+γ dw-c):=by rw [<- د,<- zpow_add₀ h2];congr 1;push_cast [k2];ring rw [hx,hI];field_simp;linear_combination (((n:ℚ)*sv w*2^(γ w-b0)-S1)*sv gw)*hB end @[inline] def p2 (k:Nat):Nat:=if k<63 then ((1:ו)<< Bool | .ofNat s=>a< b*p2 s | .negSucc s=>a*p2 (s+1)< b @[inline] def ge2 (a b:Nat):Int-> Bool | .ofNat s=>a >= b*p2 s | .negSucc s=>a*p2 (s+1) >= b @[inline] def fl2 (a b:Nat):Int := let i:Int:=ἃ (lg a)-ἃ (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:Nat):Int-> Nat × Nat | .ofNat s=>(a*p2 s,b) | .negSucc s=>(a,b*p2 (s+1)) @[inline] def YN (s:Bool) (N D:Nat) (E:Int):ז := if D==0 then 0x7fc00000 else if N==0 then if s then 0x80000000 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 0x80000000 else 0 else if t < -126 then let c:=sc2 N D (E+149) let f:=ν c.1 c.2 if f==0 then if s then 0x80000000 else 0 else match Nat.decLe 8388608 f with | isTrue _=>σ s 1 0 | isFalse _=>σ s 0 f else let c:=sc2 N D (23-r) let m:=ν c.1 c.2 let k:=m==16777216 let x:=if k then t+1 else t let y:=if k then 8388608 else m if x > 127 then if s then 0xff800000 else 0x7f800000 else σ s (Int.toNat (x+127)) (y-8388608) @[inline] def Yap (sa:Bool) (a:Nat) (sb:Bool) (b:Nat):Bool × Nat := if sa==sb then (sa,a+b) else if b<= a then (sa,a-b) else (sb,b-a) @[inline] def Y3 (s1:Bool) (q1 r1:Nat) (s2:Bool) (B D:Nat):Bool × Nat × Nat := 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:Bool) (M:ו) (E:Int):ז := let L:=Yj M let t:=(Lڇ:Int)+E if M=0\/L<24\/t < -126 then YN s Mڇ 1 E else let m:=(YK M L)ڇ let k:=m==16777216 let x:=if k then t+1 else t let y:=if k then 8388608 else m if x > 127 then if s then 0xff800000 else 0x7f800000 else σ s (Int.toNat (x+127)) (y-8388608) @[inline] def Ya9 (s:Bool) (M:Nat) (E:Int):ז:=if M>>>62=0 then Ya8 s Mڈ E else YN s M 1 E @[inline] def Yba (n:Nat) (w gw bw:ο) (b0:Nat) (S1:Int) (dw:ο) (mean:Unit-> ℚ):ο := if sv dw<=0 then ἰ ((ψ w-mean ())*ψ gw/ψ dw+ψ bw) else let c2:=min (b0+γ gw) (γ bw+γ dw) let c:=Yap (φ w) (n*(δ w*p2 (γ w-b0))) (!(S1<0)) S1ڭ let D:=n*δ dw let t1:=c.2*δ gw let k1:=p2 (b0+γ gw-c2) let ra:=t1%D*k1 let Q:=Y3 (c.1 != φ gw) (t1/D*k1+ra/D) (ra%D) (φ bw) (δ bw*p2 (γ bw+γ 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-γ dw) else let N:=Q.2.1*D+Q.2.2 YN (Q.1&&N != 0) N D ((c2:Int)-149-γ dw) lemma ZE (k:Nat):p2 k=2^k:=by unfold p2;split . rename_i h;have hk:k.toUInt64ڇ=k:=Ϭ (by unfold ἶ;omega);rw [ω,hk,ζ (by omega:k<64),UInt64.toNat_one,Nat.one_shiftLeft] exact ζ (Ὃ ב א) . rfl lemma Zdf (n:Nat):lg n=nڕ:=by unfold lg;dsimp only;split . rename_i h;by_cases h0:nڈ=0 . have:n=0:=by rw [<- h,h0];rfl subst this decide . rw [Zj _ h0,h] . rfl lemma Zdg (a b:Nat) (e:Int):lt2 a b e=ἂ a b e:=by cases e <;> simp [lt2,ἂ,ZE,π] lemma Zdh (a b:Nat) (e:Int):ge2 a b e=ἅ a b e:=by cases e <;> simp [ge2,ἅ,ZE,π] lemma Zdi:sc2=ἄ:=by funext a b e;cases e <;> simp [sc2,ἄ,ZE,π] lemma Zbo:fl2=Ἃ:=by funext a b;simp only [fl2,Ἃ,Zdf,Zdg,Zdh] lemma Zaq (s:Bool) (N D:Nat) (E:Int):YN s N D E=ἳ s N D E:=by unfold YN;rw [Zbo,Zdi];rfl lemma Zdj (s:Bool) (M:ו) (E:Int):Ya8 s M E=YN s Mڇ 1 E:=by unfold Ya8;dsimp only;split . rfl . rename_i h simp only [not_or,UInt64.not_lt] at h obtain ⟨hM,hL,ht⟩:=h have hN:Mڇ≠0:=λ e=>hM (θ.mp (by simpa using e)) have hr:=Zj M hM have h4:24<= M.toNatڕ:=by rw [<- hr];exact (η).mp hL obtain ⟨h0,_,_⟩:=Z7 M hM rw [ة (show Ϡ.fracWidth<= M.toNatڕ by show 23<= _;omega)] at h0 rw [h0,FloatLib.Numerics.roundShiftRightEven_eq_roundQuotientEven,hr,show Ϡ.fracWidth=23 from rfl] unfold YN rw [Zbo,Model.floorLog2_den_one _ hN] have h3:(23:Int)-(M.toNatڕ:Int)=ἔ (M.toNatڕ-24):=א simp only [show ((1:Nat)==0)=false from rfl,show (Mڇ==0)=false by simpa using hN,h3,sc2,ZE,τ,ت,Nat.one_mul,show M.toNatڕ-24+1=M.toNatڕ-23 by omega] by_cases h1:(M.toNatڕ:Int)+E > 127 . have h2:¬ (((M.toNatڕ:Int)+E)<=127):=א have hk:∀ b:Bool,(if b=true then (M.toNatڕ:Int)+E+1 else (M.toNatڕ:Int)+E) > 127:=by intro b;split <;> omega simp only [h1,hk,ث] . simp only [h1,ت,show ¬ ((M.toNatڕ:Int)+E < -150) by omega,show ¬ ((M.toNatڕ:Int)+E < -126) by omega] lemma Zdk (s:Bool) (M:Nat) (E:Int):Ya9 s M E=YN s M 1 E:=by unfold Ya9;split . rename_i h;rw [Zdj];congr 1;rw [ρ] at h;have:=(Ἕ (χ _)).mp h;simp [Nat.toUInt64];omega . rfl def Yh (s:Bool) (m:Nat):Int:=if s then -(m:Int) else m lemma Zdl (sa:Bool) (a:Nat) (sb:Bool) (b:Nat):Yh (Yap sa a sb b).1 (Yap sa a sb b).2=Yh sa a+Yh sb b:=by unfold Yap;by_cases h1:sa=sb . subst h1;cases sa <;> simp [Yh] <;> omega . rw [ب (by simpa using h1)];by_cases h2:b<= a . rw [ة h2];cases sa <;> cases sb <;> simp_all [Yh,Ἂ h2] <;> omega . rw [ب h2] have h3:a<= b:=א cases sa <;> cases sb <;> simp_all [Yh,Ἂ h3] <;> omega lemma Zbp (s:Bool) (m:Nat):(Yh s m)ڭ=m:=by cases s <;> simp [Yh] lemma Zbq (s:Bool) (m:Nat):decide (Yh s m<0)=(s&&m != 0):=by cases s . simp [Yh] . by_cases h:m=0 . simp [Yh,h] . have:(0:Int)< m:=by exact_mod_cast Ο h simp only [Yh,ث,Left.neg_neg_iff,this,decide_true,Ὥ] simpa using h lemma ZF (w:ο):sv w=Yh (φ w) (δ w):=rfl lemma Zdm (s:Bool) (a b:Nat):Yh s (a*b)=a*Yh s b:=by cases s <;> simp [Yh] lemma Z3 (s:Bool) (a b:Nat):Yh s (a*b)=Yh s a*b:=by cases s <;> simp [Yh] lemma Zbr (s t:Bool) (a b:Nat):Yh (s != t) (a*b)=Yh s a*Yh t b:=by cases s <;> cases t <;> simp [Yh] lemma Zdn (S:Int):Yh (!decide (S<0)) Sڭ=-S:=by unfold Yh;by_cases h:S<0 <;> simp [h] <;> omega lemma Zdp (s1:Bool) (q1 r1:Nat) (s2:Bool) (B D:Nat) (hr:r1< D):Yh (Y3 s1 q1 r1 s2 B D).1 ((Y3 s1 q1 r1 s2 B D).2.1*D+(Y3 s1 q1 r1 s2 B D).2.2)=Yh s1 (q1*D+r1)+Yh s2 (B*D)/\(Y3 s1 q1 r1 s2 B D).2.2< D:=by unfold Y3;by_cases h1:s1=s2 . subst h1;simp;refine ⟨?_,hr⟩;cases s1 <;> simp only [Yh] <;> simp <;> push_cast <;> ring . have e:s2=!s1:=by cases s1 <;> cases s2 <;> simp_all subst e rw [ب (by cases s1 <;> simp)] by_cases h2:B<= q1 . rw [ة h2] refine ⟨?_,hr⟩ cases s1 <;> simp only [Yh] <;> simp <;> push_cast [Ἂ h2] <;> ring . rw [ب h2] by_cases h4:r1=0 . rw [ة h4] have h5:q1<= B:=א refine ⟨?_,by dsimp only;omega⟩ cases s1 <;> simp only [Yh,h4] <;> simp <;> push_cast [Ἂ h5] <;> ring . rw [ب h4] have h5:q1+1<= B:=א have h6:r1<= D:=א refine ⟨?_,by dsimp only;omega⟩ cases s1 <;> simp only [Yh] <;> simp <;> push_cast [Ἂ h5,Ἂ h6,Nat.sub_sub] <;> ring lemma Zdq (t k D:Nat):(t/D*k+t%D*k/D)*D+t%D*k%D=t*k:=by have h1:=ἐ (t%D*k) D;have h2:=ἐ t D calc (t/D*k+t%D*k/D)*D+t%D*k%D =t/D*k*D+(D*(t%D*k/D)+t%D*k%D):=by ring _=(D*(t/D)+t%D)*k:=by rw [h1];ring _=t*k:=by rw [h2] lemma Zdr (n:Nat) (w gw bw:ο) (b0:Nat) (S1:Int) (dw:ο) (mean:Unit-> ℚ) (hn:0< n) : Yba n w gw bw b0 S1 dw mean=elL n w gw bw b0 S1 dw mean:=by unfold Yba elL;split . rfl . rename_i hd have hs:φ dw=false:=by by_contra c;simp at c;exact hd (by simp [sv,c]) have hm:0< δ dw:=by by_contra c;exact hd (by simp [sv,hs];omega) have h4:sv dw=δ dw:=by simp [sv,hs] simp only [Zdk] generalize min (b0+γ gw) (γ bw+γ dw)=c2 generalize h3:Yap (φ w) (n*(δ w*p2 (γ w-b0))) (!decide (S1<0)) S1ڭ=c have hc:(n:Int)*YaF w b0-S1=Yh c.1 c.2:=by rw [<- h3,Zdl,Zdm,Z3,Zdn,YaF,ὁ,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,ὁ,ὁ,hp,hp] generalize p2 (b0+γ gw-c2)=k1 generalize p2 (γ bw+γ dw-c2)=k2 have hD:0< n*δ dw:=ϓ hn hm rw [show Yh c.1 c.2*(Yh (φ gw) (δ gw)*(k1:Int))+n*Yh (φ bw) (δ bw)*(δ dw*(k2:Int)) = Yh (c.1 != φ gw) (c.2*δ gw*k1)+Yh (φ bw) (δ bw*k2*(n*δ dw)) by rw [Z3,Zbr,Z3,Z3];push_cast;ring] generalize c.2*δ gw=t1 generalize δ bw*k2=B generalize n*δ dw=D at hD ⊢ obtain ⟨hv,hr⟩:=Zdp (c.1 != φ gw) (t1/D*k1+t1%D*k1/D) (t1%D*k1%D) (φ bw) B D (Ρ _ hD) rw [Zdq] at hv;rw [<- hv,Zbp,Zbq];generalize Y3 (c.1 != φ gw) (t1/D*k1+t1%D*k1/D) (t1%D*k1%D) (φ 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 [ϑ,ϭ _ _ hD,϶ hr,Ϩ] 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-γ dw) hD (by rw [h0];exact hq) have h5:(Q.2.1*D+Q.2.2)%D=Q.2.2:=by rw [ϑ,ϖ,ζ hr] rw [h0,h5,show (c2:Int)-149-γ dw-1=(c2:Int)-150-γ dw by ring] at h1;rw [Zaq,h1,show (Q.2.1*D+Q.2.2 != 0)=true by simpa using h2,Bool.and_true] . rw [Zaq] @[inline] def elS (n:Nat) (w gw bw:ο) (b0:Nat) (S1:Int) (dw:ο) (mean:Unit-> ℚ):ο := if sv dw<=0 then ἰ ((ψ w-mean ())*ψ gw/ψ dw+ψ bw) else let c2:=min (b0+γ gw) (γ bw+γ dw) let c:=Yap (φ w) (n*(δ w*p2 (γ w-b0))) (!(S1<0)) S1ڭ let D:=n*δ dw let r0:=c.2%D*δ gw let k1:=p2 (b0+γ gw-c2) let ra:=r0%D*k1 let Q:=Y3 (c.1 != φ gw) ((c.2/D*δ gw+r0/D)*k1+ra/D) (ra%D) (φ bw) (δ bw*p2 (γ bw+γ 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-γ dw) else let N:=Q.2.1*D+Q.2.2 YN (Q.1&&N != 0) N D ((c2:Int)-149-γ dw) lemma sdm (a m D:Nat):a*m/D=a/D*m+a%D*m/D/\a*m%D=a%D*m%D:=by rcases ἒ D with rfl|hD . simp . have e:a*m=a%D*m+D*(a/D*m):=by rw [<- ϋ,<- Ὅ,Ἠ] rw [e,Nat.add_mul_div_left _ _ hD,Ὣ];exact ⟨ϑ _ _,rfl⟩ lemma elS_eq (n:Nat) (w gw bw:ο) (b0:Nat) (S1:Int) (dw:ο) (mean:Unit-> ℚ): elS n w gw bw b0 S1 dw mean=Yba n w gw bw b0 S1 dw mean:=by unfold elS Yba;dsimp only generalize Yap (φ w) (n*(δ w*p2 (γ w-b0))) (!decide (S1<0)) S1ڭ=c generalize n*δ dw=D rw [(sdm c.2 (δ gw) D).1,(sdm c.2 (δ gw) D).2] lemma gO {α:Type} [Inhabited α] (n:Nat) (f:Nat-> α) (k:Nat) (hk:k< n):(ς (n:=n) λ i=>f iک)[k]! =f k:=by simp_all @[inline] def u2a (h l t:ו):ו×ו:=let l':=l+t;(h+(if l'< l then 1 else 0),l') lemma u2a_v (h l t:ו) (hb:hڇ*18446744073709551616+lڇ+tڇ<340282366920938463463374607431768211456) : (u2a h l t).1.toNat*18446744073709551616+(u2a h l t).2.toNat=hڇ*18446744073709551616+lڇ+tڇ:=by unfold u2a;dsimp only have hl:=l.toNat_lt;have ht:=t.toNat_lt;have hh:=h.toNat_lt by_cases c:lڇ+tڇ<18446744073709551616 · have e:(l+t)ڇ=lڇ+tڇ:=by rw [ι];exact ζ c have nc:¬ (l+t< l):=by rw [ε,e];omega simp only [nc,if_false,e];rw [ι];simp;omega · have e:(l+t)ڇ=lڇ+tڇ-18446744073709551616:=by rw [ι];omega have cc:l+t< l:=by rw [ε,e];omega simp only [cc,if_true,e];rw [ι];simp;omega lemma qsplit (m s:Nat) (hm:m<2^24) (hs:s<=36) : (if 2*sڈ<64 then ((mڈ*mڈ)>>>1)>>>(63-2*sڈ) else (mڈ*mڈ)<<<(2*sڈ-64))ڇ*18446744073709551616+(if 2*sڈ<64 then (mڈ*mڈ)<<<(2*sڈ) else 0)ڇ=m*m*2^(2*s):=by have eq:(mڈ*mڈ)ڇ=m*m:=by rw [Ϛ,Ϭ (by unfold ἶ;omega)];exact ζ (by nlinarith) have es:(2*s.toUInt64).toNat=2*s:=by rw [Ϛ,Ϭ (by unfold ἶ;omega)];simp;omega have hq:m*m<2^48:=by nlinarith have h64:(64:ו)ڇ=64:=rfl by_cases c:2*s<64 · have c':2*sڈ<64:=by rw [ε,es,h64];exact c simp only [c',if_true] have e63:(63-2*s.toUInt64).toNat=63-2*s:=by rw [κ _ _ (by rw [η,es];show 2*s<=63;omega),es];rfl rw [Δ,Δ,ω,eq,es,e63] simp only [ρ,π,show (1:ו)ڇ=1 from rfl] rw [ζ (show 63-2*s<64 by omega),ζ c,ϐ] 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 [<- ز,<- ز];congr 1;omega,Nat.mul_div_mul_right _ _ ה] rw [e1];have:=ἐ (m*m*2^(2*s)) (2^64);rw [Μ] at this;norm_num at this ⊢;exact this · have c':¬ (2*sڈ<64):=by rw [ε,es,h64];exact c simp only [c',if_false] have e2:(2*s.toUInt64-64).toNat=2*s-64:=by rw [κ _ _ (by rw [η,es,h64];omega),es,h64] rw [ω,eq,e2,π,ζ (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 Λ hq;positivity _<=2^48*2^8:=by apply ϥ;apply ξ <;> omega _<2^64:=ב rw [ζ hb];simp only [show (0:ו)ڇ=0 from rfl,add_zero] rw [show (2:Nat)^(2*s)=2^(2*s-64)*2^64 by rw [<- ز];congr 1;omega];norm_num;ring def rsU (x:Array ο) (base n b0 j:Nat) (ph pl nh nl qh ql:ו) (ok:Bool):Bool×Nat×Nat×Nat:= if j< n then let w:=x[base+j]! let m:=(δ w)ڈ let s:=(γ w-b0)ڈ let t:=m<<>>1)>>>(63-2*s) else q<<<(2*s-64)) let ok':=ok&&(δ w=0||γ w-b0<=36) if φ 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ڇ<<<64+plڇ,nhڇ<<<64+nlڇ,qhڇ<<<64+qlڇ) termination_by n-j lemma rsU_ok (x:Array ο) (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-> (δ x[base+t]! =0 \/ γ 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 [ب א] at h;simp at h;exact ⟨h.1,h.2,λ t h1 h2=>א⟩ | succ k ih=> intro j ph pl nh nl qh ql ok hk h;unfold rsU at h;rw [ة א] at h;dsimp only at h split at h all_goals (obtain ⟨o1,o2,o3⟩:=ih (j+1) _ _ _ _ _ _ _ א h;simp only [Ν,Ὁ,ج] 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 א h2) lemma rsU_val (x:Array ο) (base n b0:Nat):∀ k j ph pl nh nl qh ql ok,n-j=k -> (∀ t,j<= t-> t< n-> (δ x[base+t]! =0 \/ γ x[base+t]!-b0<=36)) -> ph.toNat*18446744073709551616+pl.toNat+((Φ j (n-j)).map λ t=>if φ x[base+t]! then 0 else δ x[base+t]!*2^(γ x[base+t]!-b0)).sum<340282366920938463463374607431768211456 -> nh.toNat*18446744073709551616+nl.toNat+((Φ j (n-j)).map λ t=>if φ x[base+t]! then δ x[base+t]!*2^(γ x[base+t]!-b0) else 0).sum<340282366920938463463374607431768211456 -> qh.toNat*18446744073709551616+ql.toNat+((Φ j (n-j)).map λ t=>δ x[base+t]!*δ x[base+t]!*2^(2*(γ x[base+t]!-b0))).sum<340282366920938463463374607431768211456 -> (rsU x base n b0 j ph pl nh nl qh ql ok).2.1=phڇ*18446744073709551616+plڇ+((Φ j (n-j)).map λ t=>if φ x[base+t]! then 0 else δ x[base+t]!*2^(γ x[base+t]!-b0)).sum /\ (rsU x base n b0 j ph pl nh nl qh ql ok).2.2.1=nhڇ*18446744073709551616+nlڇ+((Φ j (n-j)).map λ t=>if φ x[base+t]! then δ x[base+t]!*2^(γ x[base+t]!-b0) else 0).sum /\ (rsU x base n b0 j ph pl nh nl qh ql ok).2.2.2=qhڇ*18446744073709551616+qlڇ+((Φ j (n-j)).map λ t=>δ x[base+t]!*δ x[base+t]!*2^(2*(γ 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 [ب א];simp [hk,π] | succ k ih=> intro j ph pl nh nl qh ql ok hk hg bP bN bQ have hj:j< n:=א have e2:n-(j+1)=k:=א rw [hk,Ϟ] at bP bN bQ ⊢ simp only [ὔ,ὓ] at bP bN bQ ⊢ unfold rsU;rw [ة hj];dsimp only have hgj:=hg j (le_refl _) hj have hg':(∀ t,j+1<= t-> t< n-> (δ x[base+t]! =0 \/ γ x[base+t]!-b0<=36)):=λ t h1 h2=>hg t א h2 generalize x[base+j]! =w at hgj bP bN bQ ⊢ have hm:=Ω w have hi:=iB w have em:(δ w).toUInt64ڇ=δ w:=Ϭ (by unfold ἶ;omega) have es:(γ w-b0).toUInt64ڇ=γ w-b0:=Ϭ (by unfold ἶ;omega) have et:((δ w)ڈ<<<(γ w-b0)ڈ)ڇ=δ w*2^(γ w-b0):=by rcases hgj with h0|h36 · rw [h0];simp · rw [ω,em,es,π,ζ (show γ w-b0<64 by omega)] apply ζ calc δ w*2^(γ w-b0)<2^24*2^36:=Ε hm (ξ ב h36) ה _<2^64:=ב have eq2:(if 2*(γ w-b0)ڈ<64 then (((δ w)ڈ*(δ w)ڈ)>>>1)>>>(63-2*(γ w-b0)ڈ) else ((δ w)ڈ*(δ w)ڈ)<<<(2*(γ w-b0)ڈ-64))ڇ*18446744073709551616+(if 2*(γ w-b0)ڈ<64 then ((δ w)ڈ*(δ w)ڈ)<<<(2*(γ w-b0)ڈ) else 0)ڇ=δ w*δ w*2^(2*(γ w-b0)):=by rcases hgj with h0|h36 · rw [h0];simp · exact qsplit _ _ hm h36 generalize ((δ w)ڈ<<<(γ w-b0)ڈ)=T at et ⊢ generalize (if 2*(γ w-b0)ڈ<64 then ((δ w)ڈ*(δ w)ڈ)<<<(2*(γ w-b0)ڈ) else 0)=LO at eq2 ⊢ generalize (if 2*(γ w-b0)ڈ<64 then (((δ w)ڈ*(δ w)ڈ)>>>1)>>>(63-2*(γ w-b0)ڈ) else ((δ w)ڈ*(δ w)ڈ)<<<(2*(γ w-b0)ڈ-64))=HI at eq2 ⊢ have hLO:LOڇ<= δ w*δ w*2^(2*(γ w-b0)):=by rw [<- eq2];exact Nat.le_add_left _ _ have ea:=u2a_v qh ql LO (lt_of_le_of_lt (Ἦ (le_trans hLO (ό _ _)) _) bQ) generalize u2a qh ql LO=A at ea ⊢ have k1:(A.1.toNat+HIڇ)*18446744073709551616<18446744073709551616*18446744073709551616:=by calc (A.1.toNat+HIڇ)*18446744073709551616<= A.1.toNat*18446744073709551616+A.2.toNat+HIڇ*18446744073709551616:=by rw [Ὅ];exact Nat.add_le_add_right (ό _ _) _ _=qhڇ*18446744073709551616+qlڇ+δ w*δ w*2^(2*(γ w-b0)):=by rw [ea,<- eq2];ring _<= qhڇ*18446744073709551616+qlڇ+(δ w*δ w*2^(2*(γ w-b0))+((List.map (fun t => δ x[base+t]!*δ x[base+t]!*2 ^ (2*(γ x[base+t]! - b0))) (Φ (j+1) k)).sum)):=Ἦ (ό _ _) _ _<18446744073709551616*18446744073709551616:=bQ have eqh:(A.1+HI)ڇ=A.1.toNat+HIڇ:=by rw [ι];exact ζ (Nat.lt_of_mul_lt_mul_right k1) have eQ:(A.1.toNat+HIڇ)*18446744073709551616+A.2.toNat=qhڇ*18446744073709551616+qlڇ+δ w*δ w*2^(2*(γ w-b0)):=by rw [Ὅ];linarith have bQ':(A.1+HI)ڇ*18446744073709551616+A.2.toNat+((List.map (fun t => δ x[base+t]!*δ x[base+t]!*2 ^ (2*(γ x[base+t]! - b0))) (Φ (j+1) k)).sum)<340282366920938463463374607431768211456:=by rw [eqh,eQ,ϱ];exact bQ by_cases hs:φ w=true · simp only [hs,if_true,س] at bP bN ⊢ have ep:=u2a_v nh nl T (lt_of_le_of_lt (Ἦ (by rw [et];exact ό _ _) _) 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,ϱ];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,τ,if_false,س] at bP bN ⊢ have ep:=u2a_v ph pl T (lt_of_le_of_lt (Ἦ (by rw [et];exact ό _ _) _) 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,ϱ];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 [ὔ,ὓ];push_cast;have:=h a;push_cast at ih;linarith lemma rsU_lim (x:Array ο) (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=(Ϲ (Y7 x base n b0).1:Int)-Ϲ (Y7 x base n b0).2 /\ (rsU x base n b0 0 0 0 0 0 0 0 true).2.2.2=Ϲ (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 ∈ Φ 0 (n-0),δ x[base+t]!*2^(γ x[base+t]!-b0)<=2^60:=by intro t ht;have h1:=ὢ.1 ht;have hm:=Ω x[base+t]! rcases hg t א א with h0|h36 · rw [h0];simp · calc δ x[base+t]!*2^(γ x[base+t]!-b0)<=2^24*2^36:=Ἓ א (ξ ב h36) _=2^60:=ב have tQ:∀ t ∈ Φ 0 (n-0),δ x[base+t]!*δ x[base+t]!*2^(2*(γ x[base+t]!-b0))<=2^120:=by intro t ht;have h1:=ὢ.1 ht;have hm:=Ω x[base+t]! rcases hg t א א with h0|h36 · rw [h0];simp · calc δ x[base+t]!*δ x[base+t]!*2^(2*(γ x[base+t]!-b0))<=2^24*2^24*2^72:=Ἓ (Ἓ א א) (ξ ב א) _=2^120:=ב have sP:=sumB _ (λ t=>if φ x[base+t]! then 0 else δ x[base+t]!*2^(γ x[base+t]!-b0)) (2^60) (λ t ht=>by split <;> [exact Nat.zero_le _;exact tP t ht]) have sN:=sumB _ (λ t=>if φ x[base+t]! then δ x[base+t]!*2^(γ x[base+t]!-b0) else 0) (2^60) (λ t ht=>by split <;> [exact tP t ht;exact Nat.zero_le _]) have sQ:=sumB _ (λ t=>δ x[base+t]!*δ x[base+t]!*2^(2*(γ 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 א ht) (by simp only [show (0:ו)ڇ=0 from rfl];norm_num at sP ⊢;omega) (by simp only [show (0:ו)ڇ=0 from rfl];norm_num at sN ⊢;omega) (by simp only [show (0:ו)ڇ=0 from rfl];norm_num at sQ ⊢;omega) simp only [show (0:ו)ڇ=0 from rfl,zero_mul,س,Nat.sub_zero,<- ᾇ] at v1 v2 v3 constructor · rw [v1,v2];unfold Y7 rw [ὃ,ὃ,(lP x base b0 _ (λ _ _=>rfl) (Ἁ n) _ _ ג ג).2.2] have h0:ϟ (Θ 18 0)ڤ=0:=ד rw [h0];simp only [ὖ,sub_zero,س] exact sdif _ _ _ _ (λ t=>by simp only [sv];split_ifs <;> push_cast <;> ring) · rw [v3];unfold Y6 rw [ὃ,(lS (λ j=>δ x[base+j]!*δ x[base+j]!) (λ j=>2*(γ x[base+j]! - b0)) (λ j=>by have:=Ω x[base+j]!;nlinarith) (λ j=>by have:=iB x[base+j]!;omega) _ _ ג).2] have h0:ϟ (Θ 18 0)ڤ=0:=ד rw [h0,س] @[inline] def Y8c (x:Array ο) (n:Nat) (eps:ο) (r b0:Nat) (u:Bool×Nat×Nat×Nat):Nat × Int × ο := let S1:Int:=if u.1 then (u.2.1:Int)-u.2.2.1 else (Ϲ (Y7 x (r*n) n b0).1:Int)-Ϲ (Y7 x (r*n) n b0).2 let T:Int:=(n:Int)*(if u.1 then u.2.2.2 else Ϲ (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:Int)-298)/2) λ _ => ἥ (Ἅ n x r (Ϯ n x r)+ψ eps)) @[inline] def Y8f (x:Array ο) (n:Nat) (eps:ο) (r:Nat):Nat × Int × ο := let b0:=Y2 x (r*n) n Y8c x n eps r b0 (rsU x (r*n) n b0 0 0 0 0 0 0 0 true) def Y2L (x:Array ο) (base n j acc:Nat):Nat := if j Y2L x base n j acc=(Φ j (n-j)).foldl (λ b j=>let w:=x[base+j]!;if δ w=0 then b else min b (γ w)) acc:=by intro k;induction k with | zero=>intro j acc h;unfold Y2L;rw [ب א];simp [show n-j=0 by omega] | succ k ih=>intro j acc h;unfold Y2L;rw [ة א,ih (j+1) _ א,show n-j=(n-(j+1))+1 by omega,Ϟ];simp lemma ZY2a (x:Array ο) (base n:Nat):Y2L x base n 0 255=Y2 x base n:=by rw [ZY2 x base n _ 0 _ rfl,Y2,ᾇ];simp @[inline] def RSl (h l s:ו):ו×ו:=((h<<>>1)>>>(63-s)),l<<>>32)*nU let a0:=lo1+(mid<<<32) let a1:=qh*nU+(mid>>>32)+(if a0< lo1 then 1 else 0) let sa:=s>>>32 let sb:=s&&&0xFFFFFFFF let ll:=sb*sb let mm:=2*sa*sb let s0:=ll+(mm<<<32) let s1:=sa*sa+(mm>>>32)+(if s0< ll then 1 else 0) if s1< a1 || (s1 == a1 && s0<= a0) then let t1:=a1-s1-(if a0< s0 then 1 else 0) let ie:=γ eps let c:=YF b0 ie let sT:=(2*b0-c).toUInt64 let sE:=(ie+149-c).toUInt64 let E:=(n*n*δ eps)ڈ if 2*b0-c<64 && t1>>>(63-sT) == 0 && ie+149-c<88 then let A:=RSl t1 (a0-s0) sT let B:=if sE<64 then RSl 0 E sE else (E<<<(sE-64),0) let u0:=A.2+B.2 let u1:=A.1+B.1+(if u0< A.2 then 1 else 0) let m:=n*n let t:Int:=(47-((if u1 != 0 then 64+Yj u1 else Yj u0)ڇ:Int)+mڕ+1)/2 let k:=(2*t.natAbs).toUInt64 let mU:=mڈ let ok:=if 0<= t then k<32 && u1>>>(63-k) == 0 else k<32 && (mU<<>>32 == 0 if (u1 != 0 || u0 != 0) && ok then let N:=if 0<= t then RSl u1 u0 k else (u1,u0) let den:=if 0<= t then mU else mU<<>>32) let q1:=c1/den let c0:=((c1%den)<<<32)+(l&&&0xFFFFFFFF) let q0:=c0/den let rem:=c0%den if h< den && q1<0x100000 then let q:=(q1<<<32)+q0 let root:=(Nat.sqrt qڇ)ڈ let x:Int:=((c:Int)-298)/2-t+(if root<16777216 then 0 else 1)+150 if 8388608<= root && root<33554432 && 1<= x && x<=253 then let d:=q-root*root let a:Nat:=if d == 0 && rem == 0 then 0 else if d< root then 1 else if d == root then (if 4*rem< den then 1 else if 4*rem == den then 2 else 3) else 3 let r:=ν (4*rootڇ+a) (if root<16777216 then 4 else 8) (if r=16777216 then σ false (x+1).toNat 0 else σ false xڇ (r-8388608))ڈ else 0x100000000 else 0x100000000 else 0x100000000 else 0x100000000 else 0x100000000 else 0x100000000 def rsF (x:Array ο) (base n b0 j:Nat) (ph pl nh nl qh ql:ו) (ok:Bool) (eps:ο) (r:Nat):Nat × Int × ο := if j< n then let w:=x[base+j]! let m:=(δ w)ڈ let s:=(γ w-b0)ڈ let t:=m<<>>1)>>>(63-2*s) else q<<<(2*s-64)) let ok':=ok&&(δ w=0||γ w-b0<=36) if φ w then let p:=u2a nh nl t;rsF x base n b0 (j+1) ph pl p.1 p.2 qh' a.2 ok' eps r else let p:=u2a ph pl t;rsF x base n b0 (j+1) p.1 p.2 nh nl qh' a.2 ok' eps r else let f:=if ok && n<256 && ph == 0 && nh == 0 then RSfin n b0 pl nl qh ql eps else 0x100000000 if f<0x100000000 then (b0,(plڇ:Int)-nlڇ,fڨ) else Y8c x n eps r b0 (ok&&n<256,phڇ<<<64+plڇ,nhڇ<<<64+nlڇ,qhڇ<<<64+qlڇ) termination_by n-j lemma u64m2 (a b:ו) (h:aڇ*bڇ<2^64):(a*b)ڇ=aڇ*bڇ:=by rw [Ϛ,ζ h] lemma u64a2 (a b:ו) (h:aڇ+bڇ<2^64):(a+b)ڇ=aڇ+bڇ:=by rw [ι,ζ h] lemma Ra (x:ו):(x&&&0xFFFFFFFF).toNat=x.toNat%2^32:=by rw [ὠ,show (0xFFFFFFFF:ו).toNat=2^32-1 from rfl,Ψ] lemma Rb (x:ו):(x>>>32)ڇ=xڇ/2^32:=by rw [Δ,ρ];rfl lemma Rn (n:Nat) (h:n<2^64):n.toUInt64ڇ=n:=by simp [Ἇ];omega lemma Rc (a b:ו):(if a< b then (1:ו) else 0)ڇ=if aڇ< bڇ then 1 else 0:=by split <;> simp_all [ε] lemma R1 (n:Nat) (qh ql lo1 mid a0:ו) (hn:n<256) (hq:qhڇ<2^48) (e1:lo1=(ql&&&0xFFFFFFFF)*nڈ) (e2:mid=(ql>>>32)*nڈ) (e3:a0=lo1+(mid<<<32)) : (qh*n.toUInt64+(mid>>>32)+(if a0< lo1 then 1 else 0)).toNat*2^64+a0.toNat=n*(qh.toNat*2^64+ql.toNat):=by have en:=Rn n א have ha:=Ra ql;have hb:=Rb ql;have hql:=ql.toNat_lt generalize hx:qlڇ%2^32=X at ha;generalize hy:qlڇ/2^32=Y at hb have hX:X<2^32:=א have hY:Y<2^32:=א have hq0:qlڇ=Y*2^32+X:=א have hXn:X*n<2^40:=by nlinarith have hYn:Y*n<2^40:=by nlinarith have hqn:qhڇ*n<2^56:=by nlinarith have l1:lo1ڇ=X*n:=by rw [e1,u64m2 _ _ (by rw [ha,en];omega),ha,en] have l2:midڇ=Y*n:=by rw [e2,u64m2 _ _ (by rw [hb,en];omega),hb,en] have l3:(mid<<<32)ڇ=Y*n*2^32%2^64:=by rw [ZaS _ _ ד,l2];rfl have l4:(mid>>>32)ڇ=Y*n/2^32:=by rw [Rb,l2] have l5:a0ڇ=(X*n+Y*n*2^32%2^64)%2^64:=by rw [e3,ι,l1,l3] have l6:(qh*nڈ)ڇ=qhڇ*n:=by rw [u64m2 _ _ (by rw [en];omega),en] have e:n*(qhڇ*2^64+qlڇ)=qhڇ*n*2^64+Y*n*2^32+X*n:=by rw [hq0];ring rw [e,u64a2 _ _ (by rw [Rc,u64a2 _ _ (by rw [l6,l4];omega),l6,l4];split <;> omega),u64a2 _ _ (by rw [l6,l4];omega),l6,l4,Rc,l5,l1] split <;> omega lemma R2 (s ll mm s0:ו) (hs:sڇ<2^62) (e1:ll=(s&&&0xFFFFFFFF)*(s&&&0xFFFFFFFF)) (e2:mm=(2:ו)*(s>>>32)*(s&&&0xFFFFFFFF)) (e3:s0=ll+(mm<<<32)) : ((s>>>32)*(s>>>32)+(mm>>>32)+(if s0< ll then 1 else 0)).toNat*2^64+s0.toNat=s.toNat*s.toNat:=by have ha:=Ra s;have hb:=Rb s generalize hx:sڇ%2^32=X at ha;generalize hy:sڇ/2^32=Y at hb have hX:X<2^32:=א have hY:Y<2^30:=א have hXX:X*X<2^64:=by nlinarith have hYY:Y*Y<2^60:=by nlinarith have hYX:Y*X<2^62:=by nlinarith have l1:llڇ=X*X:=by rw [e1,u64m2 _ _ (by rw [ha];omega),ha] have l2a:((2:ו)*(s>>>32))ڇ=2*Y:=by rw [u64m2 _ _ (by rw [hb];show 2*Y<2^64;omega),hb];rfl have l2:mmڇ=2*(Y*X):=by rw [e2,u64m2 _ _ (by rw [l2a,ha];rw [ϋ];omega),l2a,ha,ϋ] have l3:(mm<<<32)ڇ=2*(Y*X)*2^32%2^64:=by rw [ZaS _ _ ד,l2];rfl have l5:s0ڇ=(X*X+2*(Y*X)*2^32%2^64)%2^64:=by rw [e3,ι,l1,l3] have l6:((s>>>32)*(s>>>32))ڇ=Y*Y:=by rw [u64m2 _ _ (by rw [hb];omega),hb] have e:sڇ*sڇ=Y*Y*2^64+2*(Y*X)*2^32+X*X:=by rw [show sڇ=Y*2^32+X by omega];ring rw [e,u64a2 _ _ (by rw [Rc,u64a2 _ _ (by rw [l6,Rb,l2];omega),l6,Rb,l2];split <;> omega),u64a2 _ _ (by rw [l6,Rb,l2];omega),l6,Rb,l2,Rc,l5,l1] split <;> omega lemma R3 (a1 a0 s1 s0:ו) (h:s1< a1 ∨ s1=a1 ∧ s0 ≤ a0) : (a1-s1-(if a0< s0 then 1 else 0)).toNat*2^64+(a0-s0).toNat=(a1.toNat*2^64+a0.toNat)-(s1.toNat*2^64+s0.toNat) ∧ s1.toNat*2^64+s0.toNat<= a1.toNat*2^64+a0.toNat:=by simp only [ε,η] at h have h1:=a1.toNat_lt;have h2:=a0.toNat_lt;have h3:=s1.toNat_lt;have h4:=s0.toNat_lt rcases h with h|⟨rfl,h⟩ all_goals (split <;> rename_i hc <;> simp only [ε] at hc <;> simp only [ϧ,Κ,show (1:ו).toNat=1 from rfl] <;> constructor <;> omega) lemma R4 (h l s:ו) (hs:sڇ<64) (hh:h>>>(63-s)=0):(RSl h l s).1.toNat*2^64+(RSl h l s).2.toNat=(hڇ*2^64+lڇ)*2^sڇ ∧ (RSl h l s).1.toNat<2^63:=by unfold RSl;dsimp only have h0:hڇ/2^(63-sڇ)=0:=by have:=ص Ἀ hh;rwa [Δ,Zcj s hs,ρ,ζ (show 63-sڇ<64 by omega)] at this have hP:2^(63-sڇ)*2^sڇ=2^63:=by rw [<- Ζ];congr 1;omega have hQ:2^(64-sڇ)*2^sڇ=2^64:=by rw [<- Ζ];congr 1;omega have hl:=l.toNat_lt have hp:=χ sڇ have hh1:hڇ<2^(63-sڇ):=by rw [Ἕ (χ _)] at h0;exact h0 have hhP:hڇ*2^sڇ+2^sڇ<=2^63:=by nlinarith have hD:lڇ/2^(64-sڇ)<2^sڇ:=by rw [Τ (χ _)];rw [Μ,hQ];exact hl have e1:(h<< omega),u64a2 _ _ א,Rc,ι] split <;> omega lemma R6 (u1 u0:ו) (h:u1ڇ*2^64+u0ڇ≠0):(if u1 != 0 then 64+Yj u1 else Yj u0)ڇ=(u1ڇ*2^64+u0ڇ)ڕ:=by have h0:=u0.toNat_lt split · rename_i hu;have hu:u1≠0:=by simpa using hu have hn:u1ڇ≠0:=λ e=>hu (θ.mp (by simpa using e)) have hj:=Zj u1 hu have hl:=ϩ (n:=u1ڇ) (k:=64) hn rw [u64a2 _ _ (by rw [hj];have:=(ϩ hn).mpr u1.toNat_lt;exact (by norm_num;omega)),hj] rw [show (64:ו)ڇ=64 from rfl] symm;rw [ϙ h];have a:=ϕ hn;have b:=ϔ (n:=u1ڇ) constructor · calc 2^(64+u1.toNatڕ)=2^u1.toNatڕ*2^64:=by rw [Ζ,Μ] _ ≤ u1ڇ*2^64:=Α _ a _ ≤ _:=ό _ _ · calc u1ڇ*2^64+u0ڇ<(u1ڇ+1)*2^64:=by rw [Ὅ];omega _ ≤ 2^(u1.toNatڕ+1)*2^64:=Α _ b _=2^(64+u1.toNatڕ+1):=by rw [show 64+u1.toNatڕ+1=(u1.toNatڕ+1)+64 by omega];exact (Ζ 2 _ 64).symm · rename_i hu;have hu:u1=0:=by simpa using hu subst hu;simp only [Κ,zero_mul,س] at h ⊢ exact Zj u0 (λ e=>h (by rw [e];rfl)) lemma R7 (h l den:ו) (hd:0>>32))/den))ڇ<2^20) : let c1:=(h<<<32)+(l>>>32);let c0:=((c1%den)<<<32)+(l&&&0xFFFFFFFF) (((c1/den)<<<32)+c0/den)ڇ=(hڇ*2^64+lڇ)/denڇ ∧ (c0%den)ڇ=(hڇ*2^64+lڇ)%denڇ ∧ (((c1/den)<<<32)+c0/den)ڇ<2^52:=by intro c1 c0 have hl:=l.toNat_lt have e1:c1ڇ=hڇ*2^32+lڇ/2^32:=by have:(h<<<32)ڇ=hڇ*2^32:=by rw [ZaS _ _ ד];exact ζ (by show hڇ*2^32<2^64;omega) rw [u64a2 _ _ (by rw [this,Rb];omega),this,Rb] have er1:(c1%den)ڇ=c1ڇ%denڇ:=ϲ _ _ have eq1:(c1/den)ڇ=c1ڇ/denڇ:=ϛ _ _ have hr1:c1ڇ%denڇ [omega;(have:=ϓ p hd;omega)] rw [ب א,ة א,ب h0,ة h] · have:=ϓ h0 hd split_ifs <;> omega · have:root*den+den ≤ d*den:=by nlinarith rw [ب (by nlinarith),ب א,ب א,ب א,ب א,ب א] lemma RT (x y z:Nat) (e:x=y-z) (h:z ≤ y):x=((y:Int)-(z:Int))ڇ:=א lemma RE (n e:Nat) (hn:n<256) (he:e<2^24):n*n*e<2^40 ∧ n*n<2^16:=by constructor <;> nlinarith lemma RR (x:Nat) (h:x<33554432):x*x<2^64:=by nlinarith lemma RSe (n b0 N0:Nat) (pl nl qh ql v:ו) (eps:ο) (fb:Unit->ο) (hn:n<256) (hv:RSfin n b0 pl nl qh ql eps=v) (hf:v<0x100000000) (hN:N0=(((n:Int)*((qhڇ*2^64+qlڇ:Nat):Int)-((plڇ:Int)-nlڇ)*((plڇ:Int)-nlڇ))ڇ<<<(2*b0-YF b0 (γ eps))+(n*n*δ eps)<<<(γ eps+149-YF b0 (γ eps)))) : vڨ=YaD N0 (n*n) (((YF b0 (γ eps):Int)-298)/2) fb:=by unfold RSfin at hv;lift_lets at hv extract_lets nU s lo1 mid a0 a1 sa sb ll mm s0 s1 t1 ie c sT sE E A B u0 u1 m t k mU ok N den h l c1 q1 c0 q0 rem q root x d a r at hv generalize hW:(if r=16777216 then σ false (x+1).toNat 0 else σ false x.toNat (r-8388608))=W at hv split_ifs at hv with g1 g2 g3 g4 g5 g6 all_goals try (subst hv;exact absurd hf ד) simp only [Ν,Ὁ,ج,خ] at g1 g2 g3 g4 g5 g6 obtain ⟨⟨⟨g1a,g1b⟩,g1c⟩,g1d⟩:=g1 obtain ⟨⟨g3a,g3b⟩,g3c⟩:=g3 obtain ⟨g4a,g4b⟩:=g4 obtain ⟨g5a,g5b⟩:=g5 obtain ⟨⟨⟨g6a,g6b⟩,g6c⟩,g6d⟩:=g6 have en:n.toUInt64ڇ=n:=Rn n א have hn0:0 rename_i hp <;> simp only [ε,not_lt] at hp · rw [κ _ _ (η.mpr א)];push_cast [Ἂ (show plڇ ≤ nlڇ by omega)];ring · rw [κ _ _ (η.mpr hp)];push_cast [Ἂ hp];ring obtain ⟨eT,hle⟩:=R3 a1 a0 s1 s0 g2 have esT:sTڇ=2*b0-c:=Rn _ א obtain ⟨eAv,hA1⟩:=R4 t1 (a0-s0) sT א g3b have esE:sEڇ=ie+149-c:=Rn _ א have hm24:=Ω eps obtain ⟨hE,hn16⟩:=RE n (δ eps) hn hm24 have eE:Eڇ=n*n*δ eps:=Rn _ א have eBv:B.1.toNat*2^64+B.2.toNat=Eڇ*2^sEڇ ∧ B.1.toNat<2^63:=by rw [show B=if sE<64 then RSl 0 E sE else (E<<<(sE-64),0) from rfl] split · rename_i hs6;obtain ⟨e1,e2⟩:=R4 0 E sE (ε.mp hs6) ג;refine ⟨?_,e2⟩;rw [e1];simp · rename_i hs6;simp only [ε,not_lt] at hs6;have hs7:64 ≤ sEڇ:=hs6 have e64:(sE-64).toNat=sE.toNat-64:=by rw [κ _ _ (η.mpr hs6)];rfl have hp:Eڇ*2^(sEڇ-64)<2^63:=calc Eڇ*2^(sEڇ-64) ≤ Eڇ*2^23:=ϥ _ (ξ ב א) _<2^63:=by rw [eE];omega have:(E<<<(sE-64))ڇ=Eڇ*2^(sEڇ-64):=by rw [ZaS _ _ (by rw [e64];omega),e64];exact ζ א simp only [this,Κ,ὣ] refine ⟨?_,hp⟩;rw [ϋ,<- Ζ,Nat.sub_add_cancel hs7] have eU:u1ڇ*2^64+u0ڇ=(A.1.toNat*2^64+A.2.toNat)+(B.1.toNat*2^64+B.2.toNat):=R5 A.1 A.2 B.1 B.2 hA1 eBv.2 rw [eA,eS] at eT hle have eN0:u1.toNat*2^64+u0.toNat=N0:=by rw [hN,<- hs,<- ᾄ,<- RT _ _ _ eT hle,eU,eAv,eBv.1,esT,esE,eE,π,π] rw [show YF b0 (γ eps)=c from rfl] have hu0:u1ڇ*2^64+u0ڇ≠0:=by rcases g4a with g|g <;> simp only [bne_iff_ne,ne_eq] at g · have:u1ڇ≠0:=λ e=>g (θ.mp (by simpa using e));omega · have:u0ڇ≠0:=λ e=>g (θ.mp (by simpa using e));omega have eL:=R6 u1 u0 hu0 have et:t=(47-(N0ڕ:Int)+((n*n)ڕ:Int)+1)/2:=by show (47-((if u1 != 0 then 64+Yj u1 else Yj u0)ڇ:Int)+((n*n)ڕ:Int)+1)/2=_ rw [eL,eN0] have hL:N0ڕ<128:=by rw [<- eN0];exact (ϩ hu0).mpr (by have:=u1.toNat_lt;have:=u0.toNat_lt;omega) have hm2:(n*n)ڕ<16:=(ϩ (ϓ hn0 hn0).ne').mpr hn16 have htb:tڭ<64:=by rcases Int.natAbs_eq t with e|e <;> omega have ek:kڇ=2*tڭ:=Rn _ א have hnt:tڭ=(if 0 ≤ t then tڇ else (-t)ڇ):=by split <;> rcases Int.natAbs_eq t with e|e <;> omega have eden:denڇ=(if 0 ≤ t then n*n else (n*n)<<<(2*(-t)ڇ)) ∧ hڇ*2^64+lڇ=(if 0 ≤ t then N0<<<(2*tڇ) else N0) ∧ denڇ<2^32:=by have eN:N=if 0≤t then RSl u1 u0 k else (u1,u0):=rfl have eD:den=if 0≤t then mU else mU<<hr (ε.mp e))];rfl rw [ex,ة ⟨hR0,hR1,hden0,g6c,g6d⟩] have hq:hڇ*2^64+lڇ=remڇ+qڇ*denڇ:=by rw [eq,erem];exact (Nat.mod_add_div' _ _).symm rw [R9 _ _ _ _ _ hden0 hq (by rw [erem];exact Ρ _ hden0) eR א] have hrr:(root*root)ڇ=rootڇ*rootڇ:=u64m2 _ _ (RR _ hR1) have hle2:rootڇ*rootڇ ≤ qڇ:=eR ▸ Nat.sqrt_le _ have ed:dڇ=qڇ-rootڇ*rootڇ:=by show (q-root*root)ڇ=_;rw [κ _ _ (η.mpr (by rw [hrr];exact hle2)),hrr] have hrem:remڇ rsF x (r*n) n b0 j ph pl nh nl qh ql ok eps r=Y8c x n eps r b0 (rsU x (r*n) n b0 j ph pl nh nl qh ql ok):=by intro k;induction k with | zero=> intro j ph pl nh nl qh ql ok hk have h0:¬j intro j ph pl nh nl qh ql ok hk have h0:j ℚ):ο := if sv dw<=0 then ἰ ((ψ w-mean ())*ψ gw/ψ dw+ψ bw) else let c2:=min (b0+γ gw) (γ bw+γ dw) let c:=Yap (φ w) (n*(δ w*p2 (γ w-b0))) (!(S1<0)) S1ڭ let D:=n*δ dw let r0:=c.2%D*δ gw let k1:=p2 (b0+γ gw-c2) let ra:=r0%D*k1 let Q:=Y3 (c.1 != φ gw) ((c.2/D*δ gw+r0/D)*k1+ra/D) (ra%D) (φ bw) (δ bw*p2 (γ bw+γ 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-γ dw) else let N:=Q.2.1*D+Q.2.2 YN (Q.1&&N != 0) N D ((c2:Int)-149-γ dw) lemma shm (w:ז) (m:ו) (k:Nat) (hk:k<=38) (h:δ w=0\/(mڇ<= γ w/\γ w-mڇ<= k)) : (Yf w<<<(Yd w-m))ڇ=δ w*2^(γ w-mڇ) /\ δ w*2^(γ w-mڇ)<2^(24+k):=by rcases h with h0 | ⟨h1,h2⟩ . have:Yf w=0:=θ.mp (by rw [Zk,h0];rfl);rw [this,h0];simp . have hsub:(Yd w-m)ڇ=γ w-mڇ:=by rw [κ _ _ (η.mpr (by rw [Zf];exact h1)), Zf] have hm:=Ω w;have hp:δ w*2^(γ w-mڇ)<2^(24+k) := calc _<2^24*2^(γ w-mڇ):=Λ hm (χ _) _<=2^24*2^k:=ϥ _ (ξ ב h2) _=2^(24+k):=by rw [ز] refine ⟨?_,hp⟩;rw [ω,hsub,Zk,ζ (show γ w-mڇ<64 by omega), π] exact ζ (lt_of_lt_of_le hp (ξ ב א)) end section open ExactRuntime FloatLib.Floats.Formats.BinaryInterchange FloatLib.Floats open Float.Model.UnpackedFloat @[inline] def rqU (a b:ו):ו := 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:ו) (fb:Unit-> ο):ο := let i:=Yj N-Yj D let R:=if N< D<<>>k=0):x<2^k:=by rw [ρ] at h;exact (Ἕ ה).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 Ο hD apply cU b1 b2 . rw [bz,د,le_div_iff₀ hDr];exact_mod_cast h1 . rw [bz,show ((r:Int)+1)=((r+1:Nat):Int) by push_cast;ring,د,div_lt_iff₀ hDr];exact_mod_cast h2 lemma rqge (a b:Nat):a/b<= ν a b:=by unfold ν;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:ν (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=σ 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 [ب (by simpa using hDm),ب (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 [ب א,ب א,ب א] by_cases hk2:m=16777216 . simp only [hk2,ض,ث] at hx ⊢;rw [ب א] . have:(m==16777216)=false:=by simpa using hk2 simp only [hk2,this,ت,τ] at hx ⊢;rw [ب א];simp lemma rqUe2 (a b:ו) (hb0:0< bڇ) (hb:bڇ<2^63) (hq:aڇ/bڇ<2^63) : (rqU a b)ڇ=ν aڇ bڇ:=by unfold rqU ν dsimp only have hq0:(a/b)ڇ=aڇ/bڇ:=ϛ a b have hr:(a%b)ڇ=aڇ%bڇ:=ϲ a b have hrl:aڇ%bڇ< bڇ:=Ρ _ hb0 have htw:(2*(a%b)).toNat=2*(a.toNat%b.toNat):=by rw [Ϛ,hr];simp;omega have hq1:(a/b+1).toNat=a.toNat/b.toNat+1:=by rw [ι,hq0];simp;omega have hm2:((a/b)%2).toNat=(a.toNat/b.toNat)%2:=by rw [ϲ,hq0];rfl have e3:((a/b)%2==0)=true ↔ (aڇ/bڇ)%2=0:=by simp only [خ];rw [<- hm2];exact ⟨λ h=>by rw [h];rfl,λ h=>θ.mp (by rw [h];rfl)⟩ by_cases c1:2*(aڇ%bڇ)< bڇ . have:2*(a%b)< b:=by rw [ε,htw];exact c1 rw [ة this,ة c1,hq0] . have:¬ 2*(a%b)< b:=by rw [ε,htw];exact c1 rw [ب this,ب c1] by_cases c2:bڇ<2*(aڇ%bڇ) . have:b<2*(a%b):=by rw [ε,htw];exact c2 rw [ة this,ة c2,hq1] . have:¬ b<2*(a%b):=by rw [ε,htw];exact c2 rw [ب this,ب c2] by_cases c3:(aڇ/bڇ)%2=0 . rw [ة (e3.mpr c3),ة (by simpa using c3),hq0] . rw [ب (λ h=>c3 (e3.mp h)),ب (by simpa using c3),hq1] lemma p2le (a b:Nat) (h:a<= b):2^a<=2^b:=ξ ב h lemma rRe (N D:ו) (hD0:0< Dڇ) (hND:Dڇ<= Nڇ) (hD:Dڇ<2^40) : let R:=if N< D<<<(Yj N-Yj D) then Yj N-Yj D-1 else Yj N-Yj D Rڇ<=63 ∧ 2^Rڇ*Dڇ<= Nڇ ∧ Nڇ<2^(Rڇ+1)*Dڇ:=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:=(ϙ (show Nڇ≠0 by omega)).mp rfl have bD:=(ϙ (show Dڇ≠0 by omega)).mp rfl have hN64:=N.toNat_lt generalize N.toNatڕ=ln at bN hln generalize D.toNatڕ=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 _ _ א have:Nڇ<2^64:=hN64;omega have hi:(Yj N-Yj D)ڇ=ln-ld:=by rw [κ _ _ (by rw [η,hln,hld];exact hle),hln,hld] have e1:2^(ld+1)*2^(ln-ld)=2^(ln+1):=by rw [<- ز,show ld+1+(ln-ld)=ln+1 by omega] have h1:Dڇ*2^(ln-ld)<2^(ln+1):=by rw [<- e1];exact Λ bD.2 ה have h2:2^(ln+1)<=2^64:=p2le _ _ א have hsh:(D<<<(Yj N-Yj D))ڇ=Dڇ*2^(ln-ld):=by rw [ω,hi,ζ (show ln-ld<64 by omega),π] exact ζ (lt_of_lt_of_le h1 h2) have e2:2^(ln-ld+1)*2^ld=2^(ln+1):=by rw [<- ز,show ln-ld+1+ld=ln+1 by omega] have up:Nڇ<2^(ln-ld+1)*Dڇ:=by have:2^(ln-ld+1)*2^ld<=2^(ln-ld+1)*Dڇ:=ϥ _ bD.1 rw [e2] at this;omega by_cases c:N< D<<<(Yj N-Yj D) . have hR:R=Yj N-Yj D-1:=ة c rw [ε,hsh] at c have hi1:1<= ln-ld:=by by_contra h;have:ln-ld=0:=א rw [this] at c;simp at c;omega have hRn:Rڇ=ln-ld-1:=by rw [hR,κ _ _ (by rw [η,hi];simp;omega),hi];simp rw [hRn] have e:ln-ld-1+1=ln-ld:=א have e3:2^(ln-ld-1)*2^(ld+1)=2^ln:=by rw [<- ز,show ln-ld-1+(ld+1)=ln by omega] have h3:2^(ln-ld-1)*Dڇ<2^(ln-ld-1)*2^(ld+1):=Nat.mul_lt_mul_of_pos_left bD.2 ה rw [e3] at h3 refine ⟨by omega,by omega,by rw [e,Μ];exact c⟩ . have hR:R=Yj N-Yj D:=ب c rw [ε,hsh] at c rw [hR,hi] exact ⟨by omega,by rw [Μ];omega,up⟩ lemma rrsGe (s:Bool) (N D U V:ו) (E:Int) (X:ο) (hD0:0< Dڇ) (hND:Dڇ<= Nڇ) (hD:Dڇ<2^40) (hU:Uڇ<2^20) (hV:Vڇ<2^20) (hE:E+127=(Uڇ:Int)-Vڇ) (hX:X=YN s Nڇ Dڇ 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)ڇ=A ∧ (if R<=23 then D else D<<<(R-23))ڇ=B ∧ sc2 Nڇ Dڇ (23-(Rڇ: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ڇ<=23:=by rw [η] at hR;simpa using hR have hsub:(23-R).toNat=23-R.toNat:=by rw [κ _ _ hR];simp have e1:2^(Rڇ+1)*2^(23-Rڇ)=2^24:=by rw [<- ز,show Rڇ+1+(23-Rڇ)=24 by omega] have e2:2^Rڇ*2^(23-Rڇ)=2^23:=by rw [<- ز,show Rڇ+(23-Rڇ)=23 by omega] have hA:Nڇ*2^(23-Rڇ)< Dڇ*2^24:=by have:=Λ hr2 (show 0<2^(23-Rڇ) by positivity) rw [ϋ,Μ (Dڇ),<- ϋ,e1] at this;linarith have hA2:2^23*Dڇ<= Nڇ*2^(23-Rڇ):=by have:=Α (2^(23-Rڇ)) hr1 rw [Μ (2^Rڇ),ϋ,e2] at this;linarith have hD24:Dڇ*2^24<2^64:=by calc Dڇ*2^24<2^40*2^24:=Λ hD ה _=2^64:=ב refine ⟨Nڇ*2^(23-Rڇ),Dڇ,?_,?_,?_,hD0,by omega,?_,hA2⟩ . rw [ة hR,ω,hsub,ζ (show 23-Rڇ<64 by omega),π] exact ζ א . rw [ة hR] . have e:(23:Int)-(Rڇ:Int)=ἃ (23-Rڇ):=by rw [Int.ofNat_eq_coe];omega rw [e];simp [sc2,ZE] . exact (Τ hD0).mpr (by linarith) . have hRn:23< Rڇ:=by rw [η] at hR;simp at hR;omega have hsub:(R-23).toNat=R.toNat-23:=by rw [κ _ _ (by rw [η];simp;omega)];simp have e1:2^23*2^(Rڇ-23)=2^Rڇ:=by rw [<- ز,show 23+(Rڇ-23)=Rڇ by omega] have e2:2^24*2^(Rڇ-23)=2^(Rڇ+1):=by rw [<- ز,show 24+(Rڇ-23)=Rڇ+1 by omega] have hB1:2^23*(Dڇ*2^(Rڇ-23))<= Nڇ:=by rw [<- ϋ,Μ (2^23),ϋ,e1,Μ];exact hr1 have hB2:Nڇ<2^24*(Dڇ*2^(Rڇ-23)):=by rw [<- ϋ,Μ (2^24),ϋ,e2,Μ];exact hr2 have hBlt:Dڇ*2^(Rڇ-23)<2^41:=by have:2^23*(Dڇ*2^(Rڇ-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ڇ,Dڇ*2^(Rڇ-23),?_,?_,?_,by positivity,by omega,?_,hB1⟩ . rw [ب hR] . rw [ب hR,ω,hsub,ζ (show Rڇ-23<64 by omega),π] exact ζ א . have e:(23:Int)-(Rڇ:Int)=ἔ (Rڇ-24):=א rw [e];simp only [sc2,ZE,Prod.mk.injEq,true_and];rw [show Rڇ-24+1=Rڇ-23 by omega] . exact (Τ ה).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)))ڇ:=by rw [hm];exact le_trans ((ϝ 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)))ڇ<=2^24:=by rw [hm];unfold ν;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:ו) else 0)ڇ=(if mUڇ=16777216 then 1 else 0):=by by_cases h:mUڇ=16777216 . have:mU=16777216:=θ.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:ו) else 0)==1 then 8388608 else mU)-8388608).toNat=(if mU.toNat=16777216 then 8388608 else mU.toNat)-8388608:=by by_cases h:mUڇ=16777216 . have:mU=16777216:=θ.mp (by rw [h];rfl) simp [this] . have:¬ mU=16777216:=λ e=>h (by rw [e];rfl) simp only [this,h,خ,ت,show ¬ ((0:ו)=1) by decide] rw [κ _ _ (by rw [η];simp;omega)];simp generalize (if mU==16777216 then (1:ו) else 0)=kk at hk hk2 ⊢ have hk1:(if mUڇ=16777216 then 1 else 0)<=1:=by split <;> omega have hRU:(R+U)ڇ=Rڇ+Uڇ:=by rw [ι];omega have hRUk:(R+U+kk)ڇ=Rڇ+Uڇ+(if mUڇ=16777216 then 1 else 0):=by rw [ι,hRU,hk];omega by_cases hc:(decide (V< R+U) && decide (R+U+kk-V<=254))=true . rw [ة hc] simp only [Ν,ج] at hc obtain ⟨hc1,hc2⟩:=hc rw [ε,hRU] at hc1 have hsub:(R+U+kk-V)ڇ=Rڇ+Uڇ+(if mUڇ=16777216 then 1 else 0)-Vڇ:=by rw [κ _ _ (by rw [η,hRUk];omega),hRUk] rw [η,hsub] at hc2 rw [hX,rrsC s Nڇ Dڇ E Rڇ א א hr1 hr2 mUڇ (by rw [hsc];exact hm.symm) א (by split <;> simp_all <;> omega),hsub,hk2] congr 1 split <;> simp_all <;> omega . rw [ب hc] lemma eok (w:ο) (h:(Ξ w)ڈ-1<254):1<=(Ξ w)ڇ ∧ (Ξ w)ڇ<=254:=by have h0:=Ὗ w rw [ε] at h by_cases hz:(Ξ w)ڇ=0 . have:(Ξ w)ڈ=0:=θ.mp (by simp [ϊ,hz]) rw [this] at h;simp at h . rw [κ _ _ (by rw [η];simp [ϊ];omega)] at h simp [ϊ] at h;omega lemma mok (w:ο) (h:1<=(Ξ w)ڇ):δ w=2^23+(ὥ w)ڇ ∧ γ w=(Ξ w)ڇ-1:=by have hne:Ξ w≠0:=λ e=>by rw [e] at h;simp at h unfold δ γ;rw [ب hne,ب hne];exact ⟨rfl,rfl⟩ end section open ExactRuntime FloatLib.Floats.Formats.BinaryInterchange FloatLib.Floats @[inline] def Ya7G (n:Nat) (w gw bw:ο) (b0:Nat) (S1:Int) (dw:ο) (mean:Unit-> ℚ) (nU b0U:ו) (S1n:Bool) (S1a:ו):ο := let ed:=(Ξ dw)ڈ if ed-1<254 && !φ dw && 0< nU && nU<4096 && S1a<0x1000000000000000 && Ξ w != 255 && Ξ gw != 255 && Ξ 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 φ w == S1n then φ w else if S1a<= x then φ w else S1n let cv:=if φ 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<=8 && qq<(1:ו)<<<(61-ks) && bs<=37 then let ra:=(r0%D)<<Ya7 n w gw bw b0 S1 dw mean) else let N:=qi*D+qr if N == 0 then 0 else if N< D then Ya7 n w gw bw b0 S1 dw mean else rrsG qs N D (c2+1) (idd+23) (λ _=>Ya7 n w gw bw b0 S1 dw mean) else Ya7 n w gw bw b0 S1 dw mean else Ya7 n w gw bw b0 S1 dw mean else Ya7 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 u64s2 (a b:ו) (h:bڇ<= aڇ):(a-b)ڇ=aڇ-bڇ:=by rw [κ _ _ (η.mpr h)] lemma u64sh (a s:ו) (hs:sڇ<64) (h:aڇ*2^sڇ<2^64):(a<<f (η.mp h) simp only [f,f',ت] by_cases g:rrڇ=0 . have g':rr=0:=θ.mp (by rw [g];rfl) simp only [g,g',ض,ث];rw [u64s2 _ _ א];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',ت,τ] rw [u64s2 _ _ (by rw [u64s2 _ _ א];simp;omega),u64s2 _ _ א,u64s2 _ _ א];simp lemma Ya7Ge (n:Nat) (w gw bw:ο) (b0:Nat) (S1:Int) (dw:ο) (mean:Unit-> ℚ) (nU b0U:ו) (S1n:Bool) (S1a:ו) (hn:0< nUڇ → nUڇ=n) (hb:b0Uڇ=b0) (hb255:b0<256) (hs:S1n=!(decide (S1<0))) (ha:S1aڇ<2^60 → S1aڇ=S1ڭ) : Ya7G n w gw bw b0 S1 dw mean nU b0U S1n S1a=Ya7 n w gw bw b0 S1 dw mean:=by unfold Ya7G dsimp only by_cases c1:((Ξ dw)ڈ-1<254 && !φ dw && 0< nU && nU<4096 && S1a<0x1000000000000000 && Ξ w != 255 && Ξ gw != 255 && Ξ bw != 255)=true . rw [ة c1] simp only [Ν,Ἒ,ج,bne_iff_ne,ne_eq] at c1 obtain ⟨⟨⟨⟨⟨⟨⟨c1a,c1b⟩,c1c⟩,c1d⟩,c1e⟩,c1f⟩,c1g⟩,c1h⟩:=c1 replace hn:=hn (by rw [ε] at c1c;simpa using c1c) have hed:=eok dw c1a obtain ⟨hmd,hid⟩:=mok dw hed.1 have hfd:=ὑ dw have hn0:0< n:=by rw [<- hn];rw [ε] at c1c;simpa using c1c have hn1:n<4096:=by rw [<- hn];rw [ε] at c1d;simpa using c1d have hSa:S1aڇ<2^60:=by rw [ε] at c1e;simpa using c1e have hS1:=ha hSa have hsv:¬ (sv dw<=0):=by unfold sv;rw [ب (by simp [c1b])];push_cast;omega have hidd:((Ξ dw).toUInt64-1).toNat=γ dw:=by rw [u64s2 _ _ (by simp [ϊ];omega),hid];simp [ϊ] by_cases c2:(Yf w == 0 || (b0U<= Yd w && Yd w-b0U<=24))=true . rw [ة c2] have hm24:=Ω w;have hg24:=Ω gw;have hb24:=Ω bw have hsh:δ w=0 ∨ (b0Uڇ<= γ w ∧ γ w-b0Uڇ<=24):=by simp only [Ὁ,خ,Ν,ج] at c2 rcases c2 with h|⟨h1,h2⟩ . left;rw [<- Zk,h];rfl . right;rw [η,Zf] at h1;refine ⟨h1,?_⟩ rw [η,u64s2 _ _ (by rw [Zf];exact h1),Zf] at h2;simpa using h2 obtain ⟨hxs,hxs2⟩:=shm w b0U 24 ב hsh rw [hb] at hxs hxs2 have hxb':n*(δ w*2^(γ w-b0))<2^60:=by have:=Ϫ hn1 hxs2 calc n*(δ w*2^(γ w-b0))<4096*2^(24+24):=this _=2^60:=ב have hxb:n*(δ w*p2 (γ w-b0))<2^60:=by rw [ZE];exact hxb' have hx:(nU*(Yf w<<<(Yd w-b0U)))ڇ=n*(δ w*p2 (γ w-b0)):=by rw [u64m2 _ _ (by rw [hn,hxs];omega),hn,hxs,ZE] generalize nU*(Yf w<<<(Yd w-b0U))=x at hx ⊢ generalize (Ξ dw)ڈ-1=idd at hidd ⊢ have hiw:=iB w;have hig:=iB gw;have hib:=iB bw;have hidb:=iB dw have hyah:Yap (φ w) (n*(δ w*p2 (γ w-b0))) (!(decide (S1<0))) S1ڭ =((if (φ w == S1n)=true then φ w else if S1a ≤ x then φ w else S1n), (if (φ w == S1n)=true then x+S1a else if S1a ≤ x then x - S1a else S1a - x)ڇ):=by unfold Yap;rw [<- hs,<- hS1,<- hx] by_cases e:φ w=S1n . simp only [e,ض,ث];rw [u64a2 _ _ א] . have e':(φ w == S1n)=false:=by simpa using e simp only [e',τ,ت] by_cases f:S1a ≤ x . have f':S1aڇ ≤ xڇ:=η.mp f simp only [f',f,ث];rw [u64s2 _ _ f'] . have f':¬ S1aڇ ≤ xڇ:=λ h=>f (η.mpr h) simp only [f',f,ت];rw [u64s2 _ _ א] have hcvb:(if (φ w == S1n)=true then x+S1a else if S1a ≤ x then x - S1a else S1a - x)ڇ<2^61:=by have:=ص Prod.snd hyah;simp only [] at this;rw [<- this] unfold Yap;split_ifs <;> simp <;> omega generalize (if (φ w == S1n)=true then x+S1a else if S1a ≤ x then x - S1a else S1a - x)=cv at hyah hcvb ⊢ generalize (if (φ w == S1n)=true then φ w else if S1a ≤ x then φ w else S1n)=cs at hyah ⊢ have hDb:2^23<= n*δ dw ∧ n*δ dw<2^36:=by have u:=Ϫ hn1 (Ω dw) refine ⟨le_trans (show 2^23<= δ dw by rw [hmd];omega) (ᾃ _ hn0),lt_of_lt_of_eq u ב⟩ have hD:(nU*Yf dw)ڇ=n*δ dw:=by rw [u64m2 _ _ (by rw [hn,Zk];omega),hn,Zk] generalize nU*Yf dw=D at hD ⊢ have hbg:(b0U+Yd gw)ڇ=b0+γ gw:=by rw [u64a2 _ _ (by rw [hb,Zf];omega),hb,Zf] have hbd:(Yd bw+idd)ڇ=γ bw+γ 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)ڇ=min (b0+γ gw) (γ bw+γ dw):=by split <;> rename_i h <;> rw [η,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))ڇ=b0+γ gw-min (b0+γ gw) (γ bw+γ 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))ڇ=γ bw+γ dw-min (b0+γ gw) (γ bw+γ 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ڇ:=א have hmg:=Zk gw;have hmb:=Zk bw have hq0:(cv/D)ڇ=cvڇ/Dڇ:=ϛ cv D have hq0b:cvڇ/Dڇ<2^38:=by apply (Τ hDp).mpr calc cvڇ<2^61:=hcvb _=2^38*2^23:=ב _<=2^38*Dڇ:=ϥ _ א have hr0:(cv%D)ڇ=cvڇ%Dڇ:=ϲ cv D have hr0b:cvڇ%Dڇ<2^36:=lt_of_lt_of_le (Ρ _ hDp) א have hA1:cvڇ/Dڇ*δ gw<2^62:=by calc cvڇ/Dڇ*δ gw<2^38*2^24:=Ϫ hq0b hg24 _=2^62:=ב have hA2:cvڇ%Dڇ*δ gw<2^60:=by calc cvڇ%Dڇ*δ gw<2^36*2^24:=Ϫ hr0b hg24 _=2^60:=ב have hA3:cvڇ%Dڇ*δ gw/Dڇ<2^24:=by apply (Τ hDp).mpr have:=Ϫ (Ρ cvڇ hDp) hg24 linarith have hm1:(cv/D*Yf gw)ڇ=cvڇ/Dڇ*δ gw:=by rw [u64m2 _ _ (by rw [hq0,hmg];omega),hq0,hmg] have hm2:(cv%D*Yf gw)ڇ=cvڇ%Dڇ*δ gw:=by rw [u64m2 _ _ (by rw [hr0,hmg];omega),hr0,hmg] have hqq:(cv/D*Yf gw+cv%D*Yf gw/D)ڇ=cvڇ/Dڇ*δ gw+cvڇ%Dڇ*δ gw/Dڇ:=by rw [u64a2 _ _ (by rw [hm1,ϛ,hm2];omega),hm1,ϛ,hm2] generalize cv/D*Yf gw+cv%D*Yf gw/D=qq at hqq ⊢ by_cases c3:(decide (ks ≤ 8) && decide (qq<1 <<< (61 - ks)) && decide (bs ≤ 37))=true . rw [ة c3] simp only [Ν,ج] at c3 obtain ⟨⟨c3a,c3b⟩,c3c⟩:=c3 have hks8:ksڇ ≤ 8:=by rw [η] at c3a;simpa using c3a have hbs37:bsڇ ≤ 37:=by rw [η] at c3c;simpa using c3c have h61s:(61-ks).toNat=61-ks.toNat:=by rw [u64s2 _ _ (by simp;omega)];simp have h61:((1:ו) <<< (61 - ks))ڇ=2^(61-ksڇ):=by rw [u64sh _ _ (by rw [h61s];omega) (by rw [h61s,UInt64.toNat_one,one_mul];exact Ὃ (by norm_num:1<2) א),h61s];simp have hqqb:qqڇ<2^(61-ksڇ):=by rw [ε,h61] at c3b;exact c3b have e61:2^(61-ksڇ)*2^ksڇ=2^61:=by rw [<- ز,show 61-ksڇ+ksڇ=61 by omega] have hpk:2^ksڇ<=2^8:=ξ ב hks8 have hrm:(cv % D*Yf gw % D)ڇ=cvڇ%Dڇ*δ gw%Dڇ:=by rw [ϲ,hm2] have hrmb:cvڇ%Dڇ*δ gw%Dڇ<2^36:=lt_of_lt_of_le (Ρ _ hDp) א have hrab:cvڇ%Dڇ*δ gw%Dڇ*2^ksڇ<2^44:=by calc _<2^36*2^8:=Ε hrmb hpk ה _=2^44:=ב have hra:((cv % D*Yf gw % D) <<< ks)ڇ=cvڇ%Dڇ*δ gw%Dڇ*2^ksڇ:=by rw [u64sh _ _ א (by rw [hrm];omega),hrm] generalize (cv % D*Yf gw % D) <<< ks=ra at hra ⊢ have hqsb:qqڇ*2^ksڇ<2^61:=by rw [<- e61];exact Λ hqqb ה have hqs:(qq <<< ks)ڇ=qqڇ*2^ksڇ:=by rw [u64sh _ _ א א] have hrd:raڇ/Dڇ<= raڇ:=Nat.div_le_self _ _ have hqa:(qq <<< ks+ra / D)ڇ=qqڇ*2^ksڇ+raڇ/Dڇ:=by rw [u64a2 _ _ (by rw [hqs,ϛ];omega),hqs,ϛ] generalize qq <<< ks+ra / D=qa at hqa ⊢ have hrr:(ra % D)ڇ=raڇ%Dڇ:=ϲ ra D have hrrD:raڇ%Dڇ< Dڇ:=Ρ _ hDp generalize ra % D=rr at hrr ⊢ have hpb:2^bsڇ<=2^37:=ξ ב hbs37 have hBb:δ bw*2^bsڇ<2^61:=by calc _<2^24*2^37:=Ε hb24 hpb ה _=2^61:=ב have hB:(Yf bw <<< bs)ڇ=δ bw*2^bsڇ:=by rw [u64sh _ _ א (by rw [hmb];omega),hmb] generalize Yf bw <<< bs=B at hB ⊢ have hrab2:raڇ<2^44:=by rw [hra];exact hrab have hqab:qaڇ<2^62:=by rw [hqa];have:=Nat.div_le_self raڇ Dڇ;omega have hY1:=Y1e (cs != φ gw) (φ bw) qa rr B D א א have hqib:(if (cs != φ gw) == φ bw then qa+B else if B ≤ qa then qa-B else if rr == 0 then B-qa else B-qa-1)ڇ<2^63:=by have:=ص (λ p=>p.2.1) hY1;simp only [] at this;rw [<- this] unfold Y3;split_ifs <;> simp <;> omega have hqrb:(if (cs != φ gw) == φ bw then rr else if B ≤ qa then rr else if rr == 0 then 0 else D-rr)ڇ< Dڇ:=by have:=ص (λ p=>p.2.2) hY1;simp only [] at this;rw [<- this] unfold Y3;split_ifs <;> simp <;> omega generalize (if (cs != φ gw) == φ bw then (cs != φ gw) else if B ≤ qa then (cs != φ gw) else φ bw)=qs at hY1 ⊢ generalize (if (cs != φ gw) == φ 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 != φ gw) == φ bw then rr else if B ≤ qa then rr else if rr == 0 then 0 else D-rr)=qr at hY1 hqrb ⊢ have hY7:Ya7 n w gw bw b0 S1 dw mean=(if 16777216 ≤ qiڇ then YN qs (2*qiڇ+(if qrڇ=0 then 0 else 1)) 1 ((c2ڇ:Int)-150-γ dw) else YN (qs&&qiڇ*Dڇ+qrڇ != 0) (qiڇ*Dڇ+qrڇ) Dڇ ((c2ڇ:Int)-149-γ dw)):=by unfold Ya7;rw [ب 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=γ dw+23:=by rw [u64a2 _ _ (by rw [hidd];simp;omega),hidd];simp by_cases h16:16777216 ≤ qiڇ . have h16':(16777216:ו) ≤ qi:=η.mpr (by simpa using h16) rw [ة h16'] 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 [Ϛ];simp;omega by_cases e:qrڇ=0 . have e':qr=0:=θ.mp (by rw [e];rfl) simp only [e',e,ض,ث];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,τ,ت];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ڇ:Int)-150-γ dw) (Ya7 n w gw bw b0 S1 dw mean) ג (by rw [hM];simp;omega) ג (by rw [hc2];omega) (by rw [hV];omega) (by rw [hV];push_cast;omega) (by rw [hY7,ة h16,hM];simp) . have h16':¬ (16777216:ו) ≤ qi:=λ h=>h16 (by rw [η] at h;simpa using h) rw [ب h16'] have hqi24:qiڇ<2^24:=א have hqD:qiڇ*Dڇ<2^60:=by calc qiڇ*Dڇ<2^24*2^36:=Ϫ hqi24 א _=2^60:=ב have hNv:(qi*D+qr)ڇ=qiڇ*Dڇ+qrڇ:=by rw [u64a2 _ _ (by rw [u64m2 _ _ א];omega),u64m2 _ _ א] by_cases hN0:qiڇ*Dڇ+qrڇ=0 . have:(qi*D+qr==0)=true:=by simp only [خ];exact θ.mp (by rw [hNv,hN0];rfl) rw [ة this,hY7,ب h16,hN0] unfold YN;simp [show Dڇ≠0 by omega] . have:¬(qi*D+qr==0)=true:=by simp only [خ];intro h;apply hN0;rw [<- hNv,h];rfl rw [ب this] by_cases hND:qiڇ*Dڇ+qrڇ< Dڇ . have:qi*D+qr< D:=by rw [ε,hNv];exact hND rw [ة this] . have:¬ qi*D+qr< D:=by rw [ε,hNv];exact hND rw [ب this] 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ڇ:Int)-149-γ dw) (Ya7 n w gw bw b0 S1 dw mean) hDp (by rw [hNv];omega) א (by rw [hU,hc2];omega) (by rw [hV];omega) (by rw [hU,hV];push_cast;omega) (by have e:(qiڇ*Dڇ+qrڇ != 0)=true:=by simpa using hN0 rw [hY7,ب h16,hNv,e,Bool.and_true]) . rw [ب c3] . rw [ب c2] . rw [ب c1] end section open ExactRuntime FloatLib.Floats.Formats.BinaryInterchange FloatLib.Floats lemma YTle (x:Array ο) (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 δ w=0 then b else min b (γ 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 [ὅ];apply ih;split <;> omega exact this _ _ le_rfl end section lemma Ya7_eq (n:Nat) (w gw bw:ο) (b0:Nat) (S1:Int) (dw:ο) (mean:Unit-> ℚ): Ya7 n w gw bw b0 S1 dw mean=Yba n w gw bw b0 S1 dw mean:=by rw [<- elS_eq];unfold Ya7 elS;simp only [Zdk] end def Ybc (rows n:Nat) (eps:ο) (x g b:Array ο):Array ο := if Ἣ rows n eps x g&&bڑ==n&&b.all finiteWord then let st:=ς (n:=rows) λ r=>Y8f x n eps rک let aux:=ς (n:=rows) λ r=> let s:=st[rک]! let a:=s.2.1.natAbs ((!(s.2.1<0)),(if a>>>60 == 0 then aڈ else 0x1000000000000000),s.1.toUInt64) let nU:=if n<4096 then nڈ 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 (λ _=>Ϯ n x r) nU u.2.2 u.1 u.2.1 else layernormLegacyWith Yn rows n eps x g b lemma Zbs (rows n:Nat) (eps:ο) (x g:Array ο) (h:Ἣ rows n eps x g=true):0< n/\0< ψ eps:=by simp only [Ἣ,Ν,ج] at h;exact ⟨h.1.1.1.1.1.1.2,h.2⟩ lemma Zdt:Ybc=layernormSpec:=by funext rows n eps x g b;unfold Ybc layernormSpec layernormWith;split . rename_i hd;have h0:Ἣ rows n eps x g=true:=by simp only [Ν] at hd;exact hd.1.1 obtain ⟨hn,he⟩:=Zbs rows n eps x g h0;unfold layernormStable;rw [ZB _ _ _ rfl];dsimp only;congr 1;funext q;rw [ἣ];have hr:qک/n< rows:=ϡ (by simpa [Μ] using q.isLt);have hq:qک/n*n+qک%n=qک:=ἣ qک n;rw [gO rows (λ r=>(let s:=(ς (n:=rows) λ r=>Y8f x n eps rک)[r]!;let a:=s.2.1.natAbs ((!(s.2.1<0)),(if a>>>60 == 0 then aڈ 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 [Ἇ];omega) (by have:=YTle x (qک/n*n) n;unfold Y8;simp [Ἇ];omega) (by have:=YTle x (qک/n*n) n;unfold Y8;simp;omega) rfl (by split . rename_i h0;intro h;simp only [خ] at h0;have:=sh0 _ _ h0;simp [Ἇ];omega . intro h;simp at h),Ya7_eq] rw [gO rows (λ r=>ἥ (Ἅ n x r (ς (n:=rows) λ i=>Ϯ n x iک)[r]!+ψ eps)) _ hr, gO rows (λ r=>Ϯ n x r) _ hr,Zdr _ _ _ _ _ _ _ _ hn, Zde _ _ _ _ _ _ _ _ hn (λ hm=>by have:=Z2 x (qک/n*n) n (qک%n) (Ρ _ hn) (by rwa [hq]);rwa [hq] at this) (Zdc x n eps _ hn), Zdb x n eps _ hn he] . simp only [Zi] def LNj (x g b:Array ο) (n base b0:Nat) (S1:Int) (dw:ο) (mean:Unit-> ℚ) (nU b0U:ו) (S1n:Bool) (S1a:ו) (j:Nat) (out:Array ο):Array ο := if jϮ n x r) nU u.2.2 u.1 u.2.1 0 out) else out termination_by rows-r def YbcN (rows n:Nat) (eps:ο) (x g b:Array ο):Array ο := if Ἣ rows n eps x g&&bڑ==n&&b.all finiteWord then let st:=ς (n:=rows) λ r=>Y8fL x n eps rک let aux:=ς (n:=rows) λ r=> let s:=st[rک]! let a:=s.2.1.natAbs ((!(s.2.1<0)),(if a>>>60 == 0 then aڈ else 0x1000000000000000),s.1.toUInt64) let nU:=if n<4096 then nڈ else 0 LNr x g b n rows nU st aux 0 (Θ (rows*n) 0) else layernormLegacyWith Yn rows n eps x g b @[specialize] def Yaq (n:Nat) (f:Nat-> ο) (i:Nat) (acc:Array ο):Array ο := if i< n then Yaq n f (i+1) (acc.push (f i)) else acc termination_by n-i @[inline] def Ybd (n:Nat) (f:Nat-> ο):Array ο:=Yaq n f 0 (Ι n) lemma Zdz (n:Nat) (f:Nat-> ο):∀ k i (acc:Array ο),n-i=k-> (Yaq n f i acc)ڤ=accڤ ++ (Φ i (n-i)).map f:=by intro k;induction k with | zero=>intro i acc h;unfold Yaq;rw [ب א];simp [h] | succ k ih => intro i acc h;unfold Yaq;rw [ة א,ih (i+1) _ א,show n-i=(n-(i+1))+1 by omega,Ϟ];simp lemma ZdA (n:Nat) (f:Nat-> ο):Ybd n f=ς (n:=n) λ i=>f iک:=by apply ἵ;rw [Ybd,Zdz n f _ 0 _ rfl];apply ϵ <;> simp def Ybf (relu:Bool) (a b:Array ο):Array ο := Ybd aڑ λ i=>act relu (YaX a[i]! b[i]!) lemma ZdC:Ybf=addReluSpec:=by funext relu a b;simp only [Ybf,ZdA,addReluSpec,ZcQ];congr 1;funext i;rw [ح a iک i.isLt];rfl @[inline] def MxA (w:ז) (m:ו):Nat := let v:=Yf w<<<((Yd w-m)&&&63) (if φ w then 4611686018427387904-v else 4611686018427387904+v).toNat def MD (n:USize) (A B:Array Nat) (hA:nڇ<=Aڑ) (hB:nڇ<=Bڑ) (d lo:ו) (e:Int) (bw:ז) (h l:ו) (k:USize):ו := if hk:k>>63))+(if l'>>63)) h l 0 λ v2 v1 v0 c'=>YD v2 v1 v0 c' e termination_by nڇ-kڇ decreasing_by exact ZI n k hk lemma Zu6 (x:ו):x.toNatڈ=x:=ג lemma ZxA0 (w:ז) (m:ו) (h:δ w=0):(MxA w m)ڈ-4611686018427387904=0:=by have h1:Yf w=0:=θ.mp (by rw [Zk,h];rfl) unfold MxA;simp only [h1,Ὦ,Zu6];split <;> decide lemma ZxA1 (w:ז) (m:ו) (h0:δ w≠0) (h1:mڇ<=γ w) (h2:γ w<=mڇ+15) : ((((MxA w m).toUInt64-4611686018427387904).toNat:Nat):Int)=sv w*2^(γ w-m.toNat)%2^64:=by have hk:=Zk w;have hf:=Zf w;have hM:=Ω w have hs:((Yd w-m)&&&63).toNat=γ w-m.toNat:=by rw [ZaR,κ _ _ (η.mpr (by rw [hf];omega)),hf];omega have hE:2^(γ w-mڇ)<=2^15:=ξ ב א have hP:0<2^(γ w-mڇ):=χ _ have hV1:δ w*2^(γ w-mڇ)<2^39:=calc δ w*2^(γ w-mڇ)<2^24*2^15:=Ε hM hE ב _=2^39:=ב have hV0:0< δ w*2^(γ w-mڇ):=ϓ (Ο h0) hP have hv:(Yf w<<<((Yd w-m)&&&63))ڇ=δ w*2^(γ w-mڇ):=by rw [ZaS _ _ (by rw [hs];omega),hk,hs];exact ζ א have hsv:sv w*2^(γ w-mڇ)=if φ w then -((δ w*2^(γ w-mڇ):Nat):Int) else ((δ w*2^(γ w-mڇ):Nat):Int):=by unfold sv;split <;> push_cast <;> ring unfold MxA;dsimp only;rw [hsv,Zu6];generalize Yf w<<<((Yd w-m)&&&63)=v at hv;generalize δ w*2^(γ w-mڇ)=V at hv hV1 hV0 have c:(4611686018427387904:ו)ڇ=4611686018427387904:=rfl split . rw [ϧ,ϧ,c,hv];omega . rw [ϧ,ι,c,hv];omega lemma ZL15 (a b:ז) (lo:Nat) (h:δ a*δ b≠0-> γ a+γ b<= lo+15) : -(2^63:Int)<= sv a*sv b*2^(γ a+γ b-lo) /\ sv a*sv b*2^(γ a+γ b-lo)<2^63:=by rw [<- Zn];have hM:=ZK a b;by_cases h0:δ a*δ b=0 . rw [h0];split_ifs <;> simp . have hp:2^(γ a+γ b-lo)<=2^15:=ξ ב (by have:=h h0;omega) have hP:δ a*δ b*2^(γ a+γ b-lo)<2^63:=calc δ a*δ b*2^(γ a+γ b-lo)<2^48*2^15:= Ε hM hp ב _=2^63:=ב have Zh:((δ a*δ b:Nat):Int)*2^(γ a+γ b-lo)=((δ a*δ b*2^(γ a+γ b-lo):Nat):Int):=by push_cast;ring split_ifs . rw [neg_mul,Zh];omega . rw [Zh];omega lemma Zpt (x w:ο) (mx mw d lo:ו) (hd:dڇ+loڇ=mxڇ+mwڇ) (hw:δ x*δ w≠0-> mxڇ<= γ x/\mwڇ<= γ w/\γ x+γ w<= loڇ+15) : ((((((MxA x mx)ڈ-4611686018427387904)*((MxA w mw)ڈ-4611686018427387904))<< simp rcases ἁ.mp h0 with h|h . rw [ZxA0 x mx h,hz];simp . rw [ZxA0 w mw h,hz];simp . obtain ⟨h1,h2,h3⟩:=hw h0 have ea:=ZxA1 x mx (left_ne_zero_of_mul h0) h1 א have eb:=ZxA1 w mw (right_ne_zero_of_mul h0) h2 א generalize (MxA x mx)ڈ-4611686018427387904=a at ea generalize (MxA w mw)ڈ-4611686018427387904=b at eb have e1:((((a*b)<<>>63))+(if l+p>>63)ڇ=pڇ/2^63:=by rw [Δ,ρ];rfl have hl:lڇ<2^64:=Β l;have hh:hڇ<2^64:=Β h;have hq:pڇ<2^64:=Β p have e3:(if l+p= 2^64 then 1 else 0:=by by_cases hc0:l+p>>63))ڇ=(2^64-pڇ/2^63)%2^64:=by rw [ϧ,hs];simp rw [ι,ι,e2,e3,ι] generalize hڇ=a at *;generalize lڇ=b at *;generalize pڇ=c at * by_cases hT:T<0 . have hc:(c:Int)=T+2^64:=א have hd:c/2^63=1:=א rw [hd,show (2^64-1)%2^64=2^64-1 by norm_num] by_cases hk:b+c >= 2^64 . rw [ة hk] have f1:(b+c)%2^64=b+c-2^64:=א have f2:((a+(2^64-1))%2^64+1)%2^64=a:=א rw [f1,f2];push_cast;omega . rw [ب hk] have f1:(b+c)%2^64=b+c:=א have f2:((a+(2^64-1))%2^64+0)%2^64=(a+2^64-1)%2^64:=א rw [f1,f2];push_cast;omega . have hc:(c:Int)=T:=א have hd:c/2^63=0:=א rw [hd,show (2^64-0)%2^64=0 by norm_num] by_cases hk:b+c >= 2^64 . rw [ة hk] have f1:(b+c)%2^64=b+c-2^64:=א have f2:((a+0)%2^64+1)%2^64=(a+1)%2^64:=א rw [f1,f2];push_cast;omega . rw [ب hk] have f1:(b+c)%2^64=b+c:=א have f2:((a+0)%2^64+0)%2^64=a:=א rw [f1,f2];push_cast;omega lemma Zsx (h l:ו) (P:Int) (hv:((hڇ*2^64+lڇ:Nat):Int)%2^128=P%2^128) (h1:-2^127<= P) (h2:P<2^127) : ((Yx ((0:ו)-(h>>>63)) h l+(0:ו)ڇ:Nat):Int)%2^192=P%2^192:=by have hs:(h>>>63)ڇ=hڇ/2^63:=by rw [Δ,ρ];rfl have hl:lڇ<2^64:=Β l;have hh:hڇ<2^64:=Β h unfold Yx;rw [ϧ,hs];simp only [Κ] generalize hڇ=a at *;generalize lڇ=b at *;push_cast at *;omega lemma ZMD (n:USize) (A B:Array Nat) (hA:nڇ<=Aڑ) (hB:nڇ<=Bڑ) (fa fb:Nat-> ο) (mx mw d lo:ו) (e:Int) (bw:ז) (ha:∀ t,t< nڇ-> A[t]! =MxA (fa t) mx) (hb:∀ t,t< nڇ-> B[t]! =MxA (fb t) mw) (hd:dڇ+loڇ=mxڇ+mwڇ) (hw:∀ t,t< nڇ-> δ (fa t)*δ (fb t)≠0-> mxڇ<= γ (fa t)/\mwڇ<= γ (fb t)/\γ (fa t)+γ (fb t)<= loڇ+15) (hn:nڇ<2^32) (h9:δ ϒ*δ bw≠0-> loڇ<= γ ϒ+γ bw/\γ ϒ+γ bw< loڇ+128) : ∀ (D:Nat) (k:USize) (h l:ו) (P S:Int),nڇ-kڇ=D-> kڇ<= nڇ -> ((hڇ*2^64+lڇ:Nat):Int)%2^128=P%2^128-> -((kڇ:Int)*2^63)<= P-> P<=(kڇ:Int)*2^63 -> S=P+Yr fa fb loڇ kڇ (nڇ-kڇ)+sv ϒ*sv bw*2^(γ ϒ+γ bw-loڇ) -> -2^191<= S-> S<2^191 -> MD n A B hA hB d lo e bw h l k=if S=0 then 0x100000000 else (Γ S e false)ڈ:=by intro D induction D with | zero=> intro k h l P S hD hk hv hP1 hP2 hS h6 h7 have h0:¬ k< n:=by rw [υ];omega rw [MD,dif_neg h0] obtain ⟨v2,v1,v0,c',h3,-,h4⟩:=Zr lo ϒ bw ((0:ו)-(h>>>63)) h l 0 (λ v2 v1 v0 c'=>YD v2 v1 v0 c' e) ג h9 have hx:=Zsx h l P hv א א rw [h3];apply ZV v2 v1 v0 c' e S h6 h7;rw [h4,hS,show nڇ-kڇ=0 by omega,Yr];omega | succ D ih=> intro k h l P S hD hk hv hP1 hP2 hS h6 h7 have h0:k< n:=by rw [υ];omega have h8:(k+1).toNat=k.toNat+1:=by rw [Zc _ _ (by have:=ϣ n;simp;omega),ϸ] rw [MD,dif_pos h0];dsimp only have ea:A.uget k (by have:=υ.mp h0;omega)=MxA (fa kڇ) mx:=by rw [<- ha kڇ א,ح A kڇ א];rfl have eb:B.uget k (by have:=υ.mp h0;omega)=MxA (fb kڇ) mw:=by rw [<- hb kڇ א,ح B kڇ א];rfl rw [ea,eb] have hT:=Zpt (fa kڇ) (fb kڇ) mx mw d lo hd (hw kڇ א) have hB2:=ZL15 (fa kڇ) (fb kڇ) loڇ (λ hm=>(hw kڇ א hm).2.2) generalize ((((MxA (fa kڇ) mx)ڈ-4611686018427387904)*((MxA (fb kڇ) mw)ڈ-4611686018427387904))<<X[xa+t]!) (λ t=>W[wa+t]!) lo k r:=by intro r;induction r with | zero=>intro k;rfl | succ r ih=>intro k;simp only [YB,Yr,ih] @[inline] def MaU (X W b:Array ο) (inW i j:Nat) (bx bv:ז) (xp wp:Array Nat):ο := let bw:=b[j]! let lo:=Yp bx bv bw let hi:=Yu bx bv bw if h:xpڑ=inW∧wpڑ=inW∧((bx&&&0xFFFF)=255||(bv&&&0xFFFF)=255||Ξ bw=255||hi< lo||hi-lo > 15)=false then let r:=MD inWژ xp wp (by rw [h.1];exact Ϥ _ _) (by rw [h.2.1];exact Ϥ _ _) (Yk (bx>>>16)+Yk (bv>>>16)-lo) lo ((loڇ:Int)-298) bw 0 0 0 if r<0x100000000 then rڨ else Yai X W b inW i j else YaU X W b inW i j bx bv lemma ZMaU (X W b:Array ο) (inW i j:Nat) (xp wp:Array Nat) (hn:inW<1048576) (hx:xpڑ=inW-> ∀ t,t< inW-> xp[t]! =MxA X[i*inW+t]! (Yk ((Yc X inW i)>>>16))) (hw:wpڑ=inW-> ∀ t,t< inW-> wp[t]! =MxA W[j*inW+t]! (Yk ((Yc W inW j)>>>16))) : MaU X W b inW i j (Yc X inW i) (Yc W inW j) xp wp=Ἰ (inW+1) (λ t=>if t< inW then X[i*inW+t]! else ϒ) (λ t=>if t< inW then W[j*inW+t]! else b[j]!):=by unfold MaU;dsimp only;split . rename_i hg;obtain ⟨hxs,hws,hc⟩:=hg simp only [ϯ,ر] at hc obtain ⟨⟨⟨⟨c1,c2⟩,c3⟩,c4⟩,c5⟩:=hc have gx:i*inW+inW<= Xڑ∧i*inW+inW<=4294967295:=by by_contra hne;apply c1;unfold Yc;rw [dif_neg hne];decide have gw:j*inW+inW<= Wڑ∧j*inW+inW<=4294967295:=by by_contra hne;apply c2;unfold Yc;rw [dif_neg hne];decide obtain ⟨Lx,Hx,h5,hl,hp,h1⟩:=Zp X inW i gx.1 gx.2 obtain ⟨Lv,Hv,h4,hq,ho,h8⟩:=Zp W inW j gw.1 gw.2 have hxp:=hx hxs;have hwp:=hw hws generalize Yc X inW i=bx at *;generalize Yc W inW j=bv at * obtain ⟨hj,h3⟩:=Zo bx Lx Hx h5 א;obtain ⟨h9,h7⟩:=Zo bv Lv Hv h4 א obtain ⟨wl1,wl2⟩:=Zad bx bv b[j]!;obtain ⟨wh1,wh2⟩:=Zae bx bv b[j]! have d1:Hx≠255:=λ h=>c1 (Η.mp (by rw [h3,h];rfl)) have d2:Hv≠255:=λ h=>c2 (Η.mp (by rw [h7,h];rfl)) have d4:(Yp bx bv b[j]!)ڇ<=(Yu bx bv b[j]!)ڇ:=by rw [ε] at c4;omega have d5:(Yu bx bv b[j]!)ڇ-(Yp bx bv b[j]!)ڇ<=15:=by rw [gt_iff_lt,ε,κ _ _ (η.mpr d4)] at c5 simp only [not_lt] at c5;exact c5 rw [hj,h9] at wl1;rw [h3,h7] at wh1 have he:inW.toUSizeڇ=inW:=Za _ א have qx:(Yk (bx>>>16))ڇ=Lx-1:=by rw [Zq,hj] have qv:(Yk (bv>>>16))ڇ=Lv-1:=by rw [Zq,h9] have qs:(Yk (bx>>>16)+Yk (bv>>>16))ڇ=(Lx-1)+(Lv-1):=by rw [ι,qx,qv];exact ζ א have hdd:(Yk (bx>>>16)+Yk (bv>>>16)-Yp bx bv b[j]!)ڇ+(Yp bx bv b[j]!)ڇ=(Yk (bx>>>16))ڇ+(Yk (bv>>>16))ڇ:=by rw [κ _ _ (η.mpr (by rw [qs];omega)),qs,qx,qv];omega have w15:∀ t,t< inW-> δ X[i*inW+t]!*δ W[j*inW+t]!≠0-> (Yp bx bv b[j]!)ڇ<= γ X[i*inW+t]!+γ W[j*inW+t]! /\ γ X[i*inW+t]!+γ W[j*inW+t]!<=(Yp bx bv b[j]!)ڇ+15:=λ t ht hm=>ZQ wl1 wh1 d5 (h1 t ht) (h8 t ht) hm have wb:δ ϒ*δ b[j]!≠0-> (Yp bx bv b[j]!)ڇ<= γ ϒ+γ b[j]!/\γ ϒ+γ b[j]!<=(Yp bx bv b[j]!)ڇ+15:=by intro hm;have h0:δ b[j]!≠0:=λ h=>hm (by rw [h,ἲ]);have:=wl2 h0;have:=wh2 h0;constructor <;> omega apply ZgA X W inW i j b[j]! (Yp bx bv b[j]!) hn . intro t ht;exact (Zb X[i*inW+t]!).2.2.1 (by have:=(h1 t ht).2;omega) . intro t ht;exact (Zb W[j*inW+t]!).2.2.1 (by have:=(h8 t ht).2;omega) . exact c3 . exact λ t ht hm=>⟨(w15 t ht hm).1,by have:=(w15 t ht hm).2;omega⟩ . exact λ hm=>⟨(wb hm).1,by have:=(wb hm).2;omega⟩ . exact Zaf X W b inW i j . have hl2:=Zcw X W (i*inW) (j*inW) (Yp bx bv b[j]!)ڇ inW 0 (λ t _ h2 h3=>⟨(w15 t א h3).1,by have:=(w15 t א h3).2;omega⟩) have hm2:=ZL ϒ b[j]! (Yp bx bv b[j]!)ڇ (λ hm=>⟨(wb hm).1,by have:=(wb hm).2;omega⟩) rw [ZMD inWژ xp wp (by rw [hxs];exact Ϥ _ _) (by rw [hws];exact Ϥ _ _) (λ t=>X[i*inW+t]!) (λ t=>W[j*inW+t]!) (Yk (bx>>>16)) (Yk (bv>>>16)) _ _ _ b[j]! (λ t ht=>hxp t (by rw [he] at ht;exact ht)) (λ t ht=>hwp t (by rw [he] at ht;exact ht)) hdd (λ t ht hm=>by rw [he] at ht;have k1:=(Zb X[i*inW+t]!).2.2.2 (left_ne_zero_of_mul hm);have k2:=(Zb W[j*inW+t]!).2.2.2 (right_ne_zero_of_mul hm) exact ⟨by rw [qx];exact ZQa (h1 t ht).1 k1.1,by rw [qv];exact ZQa (h8 t ht).1 k2.1,(w15 t ht hm).2⟩) (by rw [he];omega) (λ hm=>⟨(wb hm).1,by have:=(wb hm).2;omega⟩) inW.toUSizeڇ 0 0 0 0 (YB X W (i*inW) (j*inW) (Yp bx bv b[j]!)ڇ 0 inW+sv ϒ*sv b[j]!*2^(γ ϒ+γ b[j]!-(Yp bx bv b[j]!)ڇ)) ג ג ג ג ג (by rw [ZYB,he];simp) א א] . exact ZcB X W b inW i j def MD2 (X W b:Array ο) (inW outW:Nat) (relu:Bool) (i j:Nat) (n:USize) (A1 A2 B:Array Nat) (hA1:nڇ<=A1ڑ) (hA2:nڇ<=A2ڑ) (hB:nڇ<=Bڑ) (d1 d2 lo1 lo2:ו) (bw:ז) (h1 l1 h2 l2:ו) (k:USize) (out:Array ο):Array ο := if hk:k>>63))+(if m1>>63))+(if m2>>63)) h1 l1 0 λ v2 v1 v0 c'=>YD v2 v1 v0 c' ((lo1ڇ:Int)-298) let r2:=YL lo2 ϒ bw ((0:ו)-(h2>>>63)) h2 l2 0 λ v2 v1 v0 c'=>YD v2 v1 v0 c' ((lo2ڇ:Int)-298) let o1:=act relu (if r1<0x100000000 then r1ڨ else Yai X W b inW i j) let o2:=act relu (if r2<0x100000000 then r2ڨ else Yai X W b inW (i+1) j) (out.set! (i*outW+j) o1).set! ((i+1)*outW+j) o2 termination_by nڇ-kڇ decreasing_by exact ZI n k hk def MVj (X W b:Array ο) (inW outW:Nat) (relu:Bool) (BX BV:Array ז) (XP WP:Array (Array Nat)) (i j:Nat) (out:Array ο):Array ο := if j 15||hi2< lo2||hi2-lo2 > 15)=false then MD2 X W b inW outW relu i j inWژ xp1 xp2 wp (by rw [h.1];exact Ϥ _ _) (by rw [h.2.1];exact Ϥ _ _) (by rw [h.2.2.1];exact Ϥ _ _) (Yk (bx1>>>16)+Yk (bv>>>16)-lo1) (Yk (bx2>>>16)+Yk (bv>>>16)-lo2) lo1 lo2 bw 0 0 0 0 0 out else (out.set! (i*outW+j) (act relu (MaU X W b inW i j bx1 bv xp1 wp))).set! ((i+1)*outW+j) (act relu (MaU X W b inW (i+1) j bx2 bv xp2 wp)) MVj X W b inW outW relu BX BV XP WP i (j+1) out else out termination_by outW-j def MVo (X W b:Array ο) (inW outW:Nat) (relu:Bool) (BX BV:Array ז) (XP WP:Array (Array Nat)) (i j:Nat) (out:Array ο):Array ο := if j>>16)) 0 (Ι inW))) else acc termination_by n-r def YaVM (rows inW outW:Nat) (relu:Bool) (X W b:Array ο):Array ο := let BX:Array ז:=ς (n:=rows) λ i=>Yc X inW iک let BV:Array ז:=ς (n:=outW) λ j=>Yc W inW jک if 2<= rows && 0< inW && inW<1048576 && rows*inW<= Xڑ && outW*inW<= Wڑ && rows*inW<=4294967295 && outW*inW<=4294967295 then let XP:Array (Array Nat):=MPr X BX inW 0 rows (Ι rows) let WP:Array (Array Nat):=MPr W BV inW 0 outW (Ι outW) MVi X W b inW outW rows relu BX BV XP WP 0 (Θ (rows*outW) 0) else YT rows outW λ i j=>act relu (YaU X W b inW i j BX[i]! BV[j]!) lemma ZMD2 (X W b:Array ο) (inW outW:Nat) (relu:Bool) (i j:Nat) (n:USize) (A1 A2 B:Array Nat) (hA1:nڇ<=A1ڑ) (hA2:nڇ<=A2ڑ) (hB:nڇ<=Bڑ) (d1 d2 lo1 lo2:ו) (bw:ז) (out:Array ο):∀ (D:Nat) (k:USize) (h1 l1 h2 l2:ו),nڇ-kڇ=D -> MD2 X W b inW outW relu i j n A1 A2 B hA1 hA2 hB d1 d2 lo1 lo2 bw h1 l1 h2 l2 k out = (out.set! (i*outW+j) (act relu (let r:=MD n A1 B hA1 hB d1 lo1 ((lo1ڇ:Int)-298) bw h1 l1 k;if r<0x100000000 then rڨ else Yai X W b inW i j))).set! ((i+1)*outW+j) (act relu (let r:=MD n A2 B hA2 hB d2 lo2 ((lo2ڇ:Int)-298) bw h2 l2 k;if r<0x100000000 then rڨ else Yai X W b inW (i+1) j)):=by intro D induction D with | zero=> intro k h1 l1 h2 l2 hD have h0:¬ k< n:=by rw [υ];omega rw [MD2,MD,MD];simp only [dif_neg h0] | succ D ih=> intro k h1 l1 h2 l2 hD have h0:k< n:=by rw [υ];omega have h8:(k+1).toNat=k.toNat+1:=by rw [Zc _ _ (by have:=ϣ n;simp;omega),ϸ] rw [MD2,MD,MD];simp only [dif_pos h0];exact ih (k+1) _ _ _ _ א lemma ZSb (a:Array ο) (p q:Nat) (v:ο) (hq:q< aڑ):(a.set! p v)[q]! =if p=q then v else a[q]!:=by rw [ح (a.set! p v) q (by simp [hq]),ح a q hq];exact Array.getElem_setIfInBounds hq lemma ZQd (r c outW:Nat) (hc:c< outW):(r*outW+c)/outW=r/\(r*outW+c)%outW=c:=by constructor . rw [ϑ,ϭ _ _ א,϶ hc,Ϩ] . rw [ϑ,ϖ,ζ hc] lemma ZQe (q outW i j:Nat) (hj:j< outW) (h0:0< outW):q=i*outW+j ↔ (q/outW=i/\q%outW=j):=by constructor . rintro rfl;exact ZQd i j outW hj . rintro ⟨h1,h2⟩;rw [<- h1,<- h2];exact (ἣ q outW).symm lemma ZMVs (X W b:Array ο) (inW outW:Nat) (relu:Bool) (BX BV:Array ז) (XP WP:Array (Array Nat)) (i j:Nat) (out:Array ο) : (if h:XP[i]!ڑ=inW∧XP[i+1]!ڑ=inW∧WP[j]!ڑ=inW∧((BX[i]!&&&0xFFFF)=255||(BX[i+1]!&&&0xFFFF)=255||(BV[j]!&&&0xFFFF)=255||Ξ b[j]! =255|| Yu BX[i]! BV[j]! b[j]!< Yp BX[i]! BV[j]! b[j]!||Yu BX[i]! BV[j]! b[j]!-Yp BX[i]! BV[j]! b[j]! > 15|| Yu BX[i+1]! BV[j]! b[j]!< Yp BX[i+1]! BV[j]! b[j]!||Yu BX[i+1]! BV[j]! b[j]!-Yp BX[i+1]! BV[j]! b[j]! > 15)=false then MD2 X W b inW outW relu i j inWژ XP[i]! XP[i+1]! WP[j]! (by rw [h.1];exact Ϥ _ _) (by rw [h.2.1];exact Ϥ _ _) (by rw [h.2.2.1];exact Ϥ _ _) (Yk (BX[i]!>>>16)+Yk (BV[j]!>>>16)-Yp BX[i]! BV[j]! b[j]!) (Yk (BX[i+1]!>>>16)+Yk (BV[j]!>>>16)-Yp BX[i+1]! BV[j]! b[j]!) (Yp BX[i]! BV[j]! b[j]!) (Yp BX[i+1]! BV[j]! b[j]!) b[j]! 0 0 0 0 0 out else (out.set! (i*outW+j) (act relu (MaU X W b inW i j BX[i]! BV[j]! XP[i]! WP[j]!))).set! ((i+1)*outW+j) (act relu (MaU X W b inW (i+1) j BX[i+1]! BV[j]! XP[i+1]! WP[j]!))) = (out.set! (i*outW+j) (act relu (MaU X W b inW i j BX[i]! BV[j]! XP[i]! WP[j]!))).set! ((i+1)*outW+j) (act relu (MaU X W b inW (i+1) j BX[i+1]! BV[j]! XP[i+1]! WP[j]!)):=by split . rename_i h;rw [ZMD2 X W b inW outW relu i j _ _ _ _ _ _ _ _ _ _ _ _ out _ 0 0 0 0 0 rfl];obtain ⟨g1,g2,g3,g⟩:=h simp only [ϯ] at g;obtain ⟨⟨⟨⟨⟨⟨⟨c1,c2⟩,c3⟩,c4⟩,c5⟩,c6⟩,c7⟩,c8⟩:=g unfold MaU;dsimp only rw [dif_pos ⟨g1,g3,by simp only [ϯ];exact ⟨⟨⟨⟨c1,c3⟩,c4⟩,c5⟩,c6⟩⟩,dif_pos ⟨g2,g3,by simp only [ϯ];exact ⟨⟨⟨⟨c2,c3⟩,c4⟩,c7⟩,c8⟩⟩] . rfl lemma ZMVj (X W b:Array ο) (inW outW rows:Nat) (relu:Bool) (BX BV:Array ז) (XP WP:Array (Array Nat)) (i:Nat) (f:Nat-> Nat-> ο) (hi:i+1< rows) (hf:∀ r c,r< rows-> c< outW-> act relu (MaU X W b inW r c BX[r]! BV[c]! XP[r]! WP[c]!)=f r c) : ∀ (D j:Nat) (out:Array ο),outW-j=D-> j<= outW-> outڑ=rows*outW -> (∀ q,q< rows*outW-> (q/outW< i\/((q/outW=i\/q/outW=i+1)/\q%outW< j))-> out[q]! =f (q/outW) (q%outW)) -> (MVj X W b inW outW relu BX BV XP WP i j out)ڑ=rows*outW /\ ∀ q,q< rows*outW-> q/outW< i+2-> (MVj X W b inW outW relu BX BV XP WP i j out)[q]! =f (q/outW) (q%outW):=by intro D induction D with | zero=> intro j out hD hj hs hv rw [MVj,ب א] refine ⟨hs,λ q hq hr=>hv q hq ?_⟩ have h0:0< outW:=Ο (by rintro rfl;simp at hq) have:=Ρ q h0;omega | succ D ih=> intro j out hD hj hs hv have hj':j< outW:=א have h0:0< outW:=א rw [MVj,ة hj'];dsimp only;rw [ZMVs] apply ih (j+1) _ א א (by simp [hs]) intro q hq hc have k1:i*outW+j< rows*outW:=by calc i*outW+j< i*outW+outW:=א _=(i+1)*outW:=by ring _<= rows*outW:=Α _ א have k2:(i+1)*outW+j< rows*outW:=by calc (i+1)*outW+j<(i+1)*outW+outW:=א _=(i+2)*outW:=by ring _<= rows*outW:=Α _ א rw [ZSb _ _ _ _ (by simp [hs];exact hq)] by_cases e2:(i+1)*outW+j=q . rw [ة e2,<- e2,(ZQd _ _ _ hj').1,(ZQd _ _ _ hj').2];exact hf _ _ hi hj' . rw [ب e2,ZSb _ _ _ _ (by rw [hs];exact hq)] by_cases e1:i*outW+j=q . rw [ة e1,<- e1,(ZQd _ _ _ hj').1,(ZQd _ _ _ hj').2];exact hf _ _ א hj' . rw [ب e1];apply hv q hq have n1:=(ZQe q outW i j hj' h0);have n2:=(ZQe q outW (i+1) j hj' h0) have z1:¬ (q/outW=i/\q%outW=j):=λ h=>e1 (n1.mpr h).symm have z2:¬ (q/outW=i+1/\q%outW=j):=λ h=>e2 (n2.mpr h).symm rcases hc with hc|⟨hc1,hc2⟩ . exact Or.inl hc . right;refine ⟨hc1,?_⟩;rcases hc1 with hc1|hc1 . have:q%outW≠j:=λ h=>z1 ⟨hc1,h⟩;omega . have:q%outW≠j:=λ h=>z2 ⟨hc1,h⟩;omega lemma ZMVo (X W b:Array ο) (inW outW rows:Nat) (relu:Bool) (BX BV:Array ז) (XP WP:Array (Array Nat)) (i:Nat) (f:Nat-> Nat-> ο) (hi:i< rows) (hf:∀ r c,r< rows-> c< outW-> act relu (MaU X W b inW r c BX[r]! BV[c]! XP[r]! WP[c]!)=f r c) : ∀ (D j:Nat) (out:Array ο),outW-j=D-> j<= outW-> outڑ=rows*outW -> (∀ q,q< rows*outW-> (q/outW< i\/(q/outW=i/\q%outW< j))-> out[q]! =f (q/outW) (q%outW)) -> (MVo X W b inW outW relu BX BV XP WP i j out)ڑ=rows*outW /\ ∀ q,q< rows*outW-> q/outW< i+1-> (MVo X W b inW outW relu BX BV XP WP i j out)[q]! =f (q/outW) (q%outW):=by intro D induction D with | zero=> intro j out hD hj hs hv rw [MVo,ب א] refine ⟨hs,λ q hq hr=>hv q hq ?_⟩ have h0:0< outW:=Ο (by rintro rfl;simp at hq) have:=Ρ q h0;omega | succ D ih=> intro j out hD hj hs hv have hj':j< outW:=א have h0:0< outW:=א rw [MVo,ة hj'] apply ih (j+1) _ א א (by simp [hs]) intro q hq hc rw [ZSb _ _ _ _ (by rw [hs];exact hq)] by_cases e1:i*outW+j=q . rw [ة e1,<- e1,(ZQd _ _ _ hj').1,(ZQd _ _ _ hj').2];exact hf _ _ hi hj' . rw [ب e1];apply hv q hq have z1:¬ (q/outW=i/\q%outW=j):=λ h=>e1 ((ZQe q outW i j hj' h0).mpr h).symm rcases hc with hc|⟨hc1,hc2⟩ . exact Or.inl hc . right;refine ⟨hc1,?_⟩;have:q%outW≠j:=λ h=>z1 ⟨hc1,h⟩;omega lemma ZMVi (X W b:Array ο) (inW outW rows:Nat) (relu:Bool) (BX BV:Array ז) (XP WP:Array (Array Nat)) (f:Nat-> Nat-> ο) (hf:∀ r c,r< rows-> c< outW-> act relu (MaU X W b inW r c BX[r]! BV[c]! XP[r]! WP[c]!)=f r c) : ∀ (D i:Nat) (out:Array ο),rows-i=D-> outڑ=rows*outW -> (∀ q,q< rows*outW-> q/outW< i-> out[q]! =f (q/outW) (q%outW)) -> (MVi X W b inW outW rows relu BX BV XP WP i out)ڑ=rows*outW /\ ∀ q,q< rows*outW-> (MVi X W b inW outW rows relu BX BV XP WP i out)[q]! =f (q/outW) (q%outW):=by intro D induction D using Nat.strong_induction_on with | _ D ih=> intro i out hD hs hv have hr:∀ q,q< rows*outW-> q/outW< rows:=λ q hq=>ϡ (by rw [Μ];exact hq) rw [MVi];split . rename_i h1 obtain ⟨a1,a2⟩:=ZMVj X W b inW outW rows relu BX BV XP WP i f h1 hf _ 0 out rfl א hs (λ q hq hc=>hv q hq א) exact ih (rows-(i+2)) א (i+2) _ rfl a1 a2 . split . rename_i h1 h2 obtain ⟨a1,a2⟩:=ZMVo X W b inW outW rows relu BX BV XP WP i f h2 hf _ 0 out rfl א hs (λ q hq hc=>hv q hq א) exact ⟨a1,λ q hq=>a2 q hq (by have:=hr q hq;omega)⟩ . rename_i h1 h2 exact ⟨hs,λ q hq=>hv q hq (by have:=hr q hq;omega)⟩ lemma ZMPx (A:Array ο) (base n:Nat) (m:ו):∀ D t (acc:Array Nat),n-t=D-> (MPx A base n m t acc)ڤ=accڤ++(Φ t (n-t)).map (λ s=>MxA A[base+s]! m):=by intro D;induction D with | zero=>intro t acc h;unfold MPx;rw [ب א];simp [h] | succ D ih=>intro t acc h;unfold MPx;rw [ة א,ih (t+1) _ א,show n-t=(n-(t+1))+1 by omega,Ϟ];simp lemma ZMPy (A:Array ο) (base n c:Nat) (m:ו):MPx A base n m 0 (Ι c)=ς (n:=n) (λ s=>MxA A[base+sک]! m):=by apply ἵ;rw [ZMPx A base n m _ 0 _ rfl];apply ϵ <;> simp lemma ZMPr (A:Array ο) (B:Array ז) (inW n:Nat):∀ D r (acc:Array (Array Nat)),n-r=D-> (MPr A B inW r n acc)ڤ=accڤ++(Φ r (n-r)).map (λ s=>MPx A (s*inW) inW (Yk (B[s]!>>>16)) 0 (Ι inW)):=by intro D;induction D with | zero=>intro r acc h;unfold MPr;rw [ب א];simp [h] | succ D ih=>intro r acc h;unfold MPr;rw [ة א,ih (r+1) _ א,show n-r=(n-(r+1))+1 by omega,Ϟ];simp lemma ZMPs (A:Array ο) (B:Array ז) (inW n c:Nat):MPr A B inW 0 n (Ι c)=ς (n:=n) (λ s=>MPx A (sک*inW) inW (Yk (B[sک]!>>>16)) 0 (Ι inW)):=by apply ἵ;rw [ZMPr A B inW n _ 0 _ rfl];apply ϵ <;> simp lemma ZeF {α:Type} [Inhabited α] (n:Nat) (f:Fin n-> α) (k:Nat) (hk:k< n):(ς (n:=n) f)[k]! =f ⟨k,hk⟩:=by rw [ح _ k (by simp [hk])];simp lemma ZMVa (X W b:Array ο) (inW rows outW:Nat) (relu:Bool) (hn:inW<1048576) (r c:Nat) (hr:r< rows) (hc:c< outW) : act relu (MaU X W b inW r c (ς (n:=rows) λ i=>Yc X inW iک)[r]! (ς (n:=outW) λ j=>Yc W inW jک)[c]! (MPr X (ς (n:=rows) λ i=>Yc X inW iک) inW 0 rows (Ι rows))[r]! (MPr W (ς (n:=outW) λ j=>Yc W inW jک) inW 0 outW (Ι outW))[c]!) = act relu (YaU X W b inW r c (ς (n:=rows) λ i=>Yc X inW iک)[r]! (ς (n:=outW) λ j=>Yc W inW jک)[c]!):=by rw [ZMPs,ZMPs];simp only [ZeF (α:=Array Nat) _ _ _ hr,ZeF (α:=Array Nat) _ _ _ hc,ZMPy,ZeF (α:=ז) _ _ _ hr,ZeF (α:=ז) _ _ _ hc];rw [ZcB] congr 1;apply ZMaU X W b inW r c _ _ hn . intro _ t ht;rw [ZeF (α:=Nat) _ _ _ ht] . intro _ t ht;rw [ZeF (α:=Nat) _ _ _ ht] lemma ZMV0:YaVM=YaV:=by funext rows inW outW relu X W b;unfold YaVM YaV;dsimp only;split . rename_i hg have hn:inW<1048576:=by simp at hg;omega rw [ZB rows outW _ rfl] obtain ⟨a1,a2⟩:=ZMVi X W b inW outW rows relu (ς (n:=rows) λ i=>Yc X inW iک) (ς (n:=outW) λ j=>Yc W inW jک) (MPr X (ς (n:=rows) λ i=>Yc X inW iک) inW 0 rows (Ι rows)) (MPr W (ς (n:=outW) λ j=>Yc W inW jک) inW 0 outW (Ι outW)) (λ r c=>act relu (YaU X W b inW r c (ς (n:=rows) λ i=>Yc X inW iک)[r]! (ς (n:=outW) λ j=>Yc W inW jک)[c]!)) (λ r c hr hc=>ZMVa X W b inW rows outW relu hn r c hr hc) _ 0 (Θ (rows*outW) 0) rfl ג (λ q _ h=>absurd h (Nat.not_lt_zero _)) apply Array.ext (by rw [a1];simp) intro q h1 h2 rw [<- ح _ q h1,a2 q (by rw [a1] at h1;exact h1)];simp . rfl def MPc (B:Array ο) (n k bk j:Nat) (m:ו) (t:Nat) (acc:Array Nat):Array Nat := if t>>16)) 0 (Ι k))) else acc termination_by N-q @[inline] def MaG (A B:Array ο) (k n r bk j:Nat) (ba bb bc:ז) (hk:k<1048576) (ap bp:Array Nat):ο := let lo:=Yp ba bc 0 let hi:=Yu ba bc 0 if h:apڑ=k∧bpڑ=k∧((ba&&&0xFFFF)=255||(bc&&&0xFFFF)=255||hi< lo||hi-lo > 15)=false then let r':=MD kژ ap bp (by rw [h.1];exact Ϥ _ _) (by rw [h.2.1];exact Ϥ _ _) (Yk (ba>>>16)+Yk (bc>>>16)-lo) lo ((loڇ:Int)-298) 0 0 0 0 if r'<0x100000000 then r'ڨ else Ya2 A B k n r bk j ba bb hk else Ya2 A B k n r bk j ba bb hk def Ya3M (batch m k n:Nat) (A B:Array ο):Array ο := if hk:k<1048576 then let bb:=Yc B Bڑ 0 let BA:Array ז:=ς (n:=batch*m) λ r=>Yc A k rک if 2<= m && 2<= n && 0< k && batch*m*k<= Aڑ && batch*k*n<= Bڑ && Bڑ<=4294967295 && batch*m*k<=4294967295 then let AP:=MPr A BA k 0 (batch*m) (Ι (batch*m)) let BC:=MQA B n k (batch*n) 0 (Ι (batch*n)) let BP:=MPC B n k (batch*n) BC 0 (Ι (batch*n)) YT (batch*m) n λ r j=>MaG A B k n r (r/m*k) j BA[r]! bb BC[r/m*n+j]! hk AP[r]! BP[r/m*n+j]! else 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 ZMPc (B:Array ο) (n k bk j:Nat) (m:ו):∀ D t (acc:Array Nat),k-t=D-> (MPc B n k bk j m t acc)ڤ=accڤ++(Φ t (k-t)).map (λ s=>MxA B[(bk+s)*n+j]! m):=by intro D;induction D with | zero=>intro t acc h;unfold MPc;rw [ب א];simp [h] | succ D ih=>intro t acc h;unfold MPc;rw [ة א,ih (t+1) _ א,show k-t=(k-(t+1))+1 by omega,Ϟ];simp lemma ZMPd (B:Array ο) (n k bk j c:Nat) (m:ו):MPc B n k bk j m 0 (Ι c)=ς (n:=k) (λ s=>MxA B[(bk+sک)*n+j]! m):=by apply ἵ;rw [ZMPc B n k bk j m _ 0 _ rfl];apply ϵ <;> simp lemma ZMQA (B:Array ο) (n k N:Nat):∀ D q (acc:Array ז),N-q=D-> (MQA B n k N q acc)ڤ=accڤ++(Φ q (N-q)).map (λ s=>MQ B n (s/n*k) (s%n) k 0 511 0):=by intro D;induction D with | zero=>intro q acc h;unfold MQA;rw [ب א];simp [h] | succ D ih=>intro q acc h;unfold MQA;rw [ة א,ih (q+1) _ א,show N-q=(N-(q+1))+1 by omega,Ϟ];simp lemma ZMQB (B:Array ο) (n k N c:Nat):MQA B n k N 0 (Ι c)=ς (n:=N) (λ s=>MQ B n (sک/n*k) (sک%n) k 0 511 0):=by apply ἵ;rw [ZMQA B n k N _ 0 _ rfl];apply ϵ <;> simp lemma ZMPC (B:Array ο) (n k N:Nat) (BC:Array ז):∀ D q (acc:Array (Array Nat)),N-q=D-> (MPC B n k N BC q acc)ڤ=accڤ++(Φ q (N-q)).map (λ s=>MPc B n k (s/n*k) (s%n) (Yk (BC[s]!>>>16)) 0 (Ι k)):=by intro D;induction D with | zero=>intro q acc h;unfold MPC;rw [ب א];simp [h] | succ D ih=>intro q acc h;unfold MPC;rw [ة א,ih (q+1) _ א,show N-q=(N-(q+1))+1 by omega,Ϟ];simp lemma ZMPD (B:Array ο) (n k N c:Nat) (BC:Array ז):MPC B n k N BC 0 (Ι c)=ς (n:=N) (λ s=>MPc B n k (sک/n*k) (sک%n) (Yk (BC[sک]!>>>16)) 0 (Ι k)):=by apply ἵ;rw [ZMPC B n k N BC _ 0 _ rfl];apply ϵ <;> simp lemma ZMQ (B:Array ο) (n bk j k:Nat):∀ D t L H,k-t=D-> L<=511-> H<=255 -> ∃ L' H':Nat,(MQ B n bk j k t L H)ڇ=L'*2^16+H'/\L'<=511/\H'<=255/\L'<= L/\H<= H'/\∀ s,t<= s-> s< k-> L'<= YR B[(bk+s)*n+j]!/\YM B[(bk+s)*n+j]!<= H':=by intro D;induction D with | zero=> intro t L H hD hL hH;unfold MQ;rw [ب א] refine ⟨L,H,?_,hL,hH,le_refl _,le_refl _,λ s h1 h2=>א⟩ have:(L*65536+H).toUInt32ڇ=(L*65536+H)%2^32:=ג rw [this];omega | succ D ih=> intro t L H hD hL hH;unfold MQ;rw [ة א];dsimp only obtain ⟨k1,k2,-,-⟩:=Zb B[(bk+t)*n+j]! obtain ⟨L',H',e,a1,a2,a4,a5,a3⟩:=ih (t+1) (min L (YR B[(bk+t)*n+j]!)) (max H (YM B[(bk+t)*n+j]!)) א א א refine ⟨L',H',e,a1,a2,by omega,by omega,λ s h1 h2=>?_⟩ rcases ὄ s (t+1) with hs|hs . have:s=t:=א subst this;constructor <;> omega . exact a3 s hs h2 lemma ZMaG (A B:Array ο) (k n r bk j:Nat) (hk:k<1048576) (ap bp:Array Nat) (bc:ז) (hbc:∃ L H:Nat,bcڇ=L*2^16+H/\L<=511/\H<=255/\∀ t,t< k-> L<= YR B[(bk+t)*n+j]!/\YM B[(bk+t)*n+j]!<= H) (hap:apڑ=k-> ∀ t,t< k-> ap[t]! =MxA A[r*k+t]! (Yk ((Yc A k r)>>>16))) (hbp:bpڑ=k-> ∀ t,t< k-> bp[t]! =MxA B[(bk+t)*n+j]! (Yk (bc>>>16))) : MaG A B k n r bk j (Yc A k r) (Yc B Bڑ 0) bc hk ap bp=Ἰ k (λ t=>A[r*k+t]!) (λ t=>B[(bk+t)*n+j]!):=by have hF:=ZcZ A B k n r bk j hk unfold MaG;dsimp only;split . rename_i hg;obtain ⟨has,hbs,hc⟩:=hg simp only [ϯ,ر] at hc obtain ⟨⟨⟨c1,c2⟩,c4⟩,c5⟩:=hc have gx:r*k+k<= Aڑ∧r*k+k<=4294967295:=by by_contra hne;apply c1;unfold Yc;rw [dif_neg hne];decide obtain ⟨Lx,Hx,h5,hl,hp,h1⟩:=Zp A k r gx.1 gx.2 obtain ⟨Lv,Hv,h4,hq,ho,h8⟩:=hbc have hxp:=hap has;have hwp:=hbp hbs generalize Yc A k r=ba at * obtain ⟨hj,h3⟩:=Zo ba Lx Hx h5 א;obtain ⟨h9,h7⟩:=Zo bc Lv Hv h4 א obtain ⟨wl1,-⟩:=Zad ba bc 0;obtain ⟨wh1,-⟩:=Zae ba bc 0 have d1:Hx≠255:=λ h=>c1 (Η.mp (by rw [h3,h];rfl)) have d2:Hv≠255:=λ h=>c2 (Η.mp (by rw [h7,h];rfl)) have d4:(Yp ba bc 0)ڇ<=(Yu ba bc 0)ڇ:=by rw [ε] at c4;omega have d5:(Yu ba bc 0)ڇ-(Yp ba bc 0)ڇ<=15:=by rw [gt_iff_lt,ε,κ _ _ (η.mpr d4)] at c5 simp only [not_lt] at c5;exact c5 rw [hj,h9] at wl1;rw [h3,h7] at wh1 have he:k.toUSizeڇ=k:=Za _ א have qx:(Yk (ba>>>16))ڇ=Lx-1:=by rw [Zq,hj] have qv:(Yk (bc>>>16))ڇ=Lv-1:=by rw [Zq,h9] have qs:(Yk (ba>>>16)+Yk (bc>>>16))ڇ=(Lx-1)+(Lv-1):=by rw [ι,qx,qv];exact ζ א have hdd:(Yk (ba>>>16)+Yk (bc>>>16)-Yp ba bc 0)ڇ+(Yp ba bc 0)ڇ=(Yk (ba>>>16))ڇ+(Yk (bc>>>16))ڇ:=by rw [κ _ _ (η.mpr (by rw [qs];omega)),qs,qx,qv];omega have w15:∀ t,t< k-> δ A[r*k+t]!*δ B[(bk+t)*n+j]!≠0-> (Yp ba bc 0)ڇ<= γ A[r*k+t]!+γ B[(bk+t)*n+j]! /\ γ A[r*k+t]!+γ B[(bk+t)*n+j]!<=(Yp ba bc 0)ڇ+15:=λ t ht hm=>ZQ wl1 wh1 d5 (h1 t ht) (h8 t ht) hm have hl2:=Zaj (λ t=>A[r*k+t]!) (λ t=>B[(bk+t)*n+j]!) (Yp ba bc 0)ڇ k 0 (λ t _ h2 h3=>⟨(w15 t א h3).1,by have:=(w15 t א h3).2;omega⟩) apply ZgY k (λ t=>A[r*k+t]!) (λ t=>B[(bk+t)*n+j]!) (Yp ba bc 0) hk . intro t ht;exact (Zb A[r*k+t]!).2.2.1 (by have:=(h1 t ht).2;omega) . intro t ht;exact (Zb B[(bk+t)*n+j]!).2.2.1 (by have:=(h8 t ht).2;omega) . exact λ t ht hm=>⟨(w15 t ht hm).1,by have:=(w15 t ht hm).2;omega⟩ . exact hF . rw [ZMD kژ ap bp (by rw [has];exact Ϥ _ _) (by rw [hbs];exact Ϥ _ _) (λ t=>A[r*k+t]!) (λ t=>B[(bk+t)*n+j]!) (Yk (ba>>>16)) (Yk (bc>>>16)) _ _ _ 0 (λ t ht=>hxp t (by rw [he] at ht;exact ht)) (λ t ht=>hwp t (by rw [he] at ht;exact ht)) hdd (λ t ht hm=>by rw [he] at ht;have k1:=(Zb A[r*k+t]!).2.2.2 (left_ne_zero_of_mul hm);have k2:=(Zb B[(bk+t)*n+j]!).2.2.2 (right_ne_zero_of_mul hm) exact ⟨by rw [qx];exact ZQa (h1 t ht).1 k1.1,by rw [qv];exact ZQa (h8 t ht).1 k2.1,(w15 t ht hm).2⟩) (by rw [he];omega) (λ hm=>absurd (by decide:δ ϒ*δ (0:ז)=0) hm) k.toUSizeڇ 0 0 0 0 (Yr (λ t=>A[r*k+t]!) (λ t=>B[(bk+t)*n+j]!) (Yp ba bc 0)ڇ 0 k) ג ג ג ג ג (by rw [he];simp [show sv (0:ז)=0 by decide]) א א] . exact hF lemma ZM3:Ya3M=Ya3:=by funext batch m k n A B;unfold Ya3M Ya3;split . rename_i hk;dsimp only;split . rw [ZB (batch*m) n _ rfl,ZB (batch*m) n _ rfl];congr 1;funext q have hq:=q.isLt have h0:0< n:=Ο (by rintro rfl;simp at hq) have hr:qک/n< batch*m:=ϡ (lt_of_lt_of_eq hq (Μ _ _)) have hj:qک%n< n:=Ρ _ h0 have hb:qک/n/m< batch:=ϡ (lt_of_lt_of_eq hr (Μ _ _)) have hc:qک/n/m*n+qک%n< batch*n:=by calc qک/n/m*n+qک%n< qک/n/m*n+n:=א _=(qک/n/m+1)*n:=by ring _<= batch*n:=Α _ א simp only [ZMPs,ZMQB,ZMPD,ZeF (α:=Array Nat) _ _ _ hr,ZeF (α:=Array Nat) _ _ _ hc,ZeF (α:=ז) _ _ _ hr,ZeF (α:=ז) _ _ _ hc,(ZQd _ _ _ hj).1,(ZQd _ _ _ hj).2,ZMPy,ZMPd] rw [ZcZ] obtain ⟨L,H,e,a1,a2,-,-,a3⟩:=ZMQ B n (qک/n/m*k) (qک%n) k _ 0 511 0 rfl ב ב apply ZMaG A B k n _ _ _ hk _ _ _ ⟨L,H,e,a1,a2,λ t ht=>a3 t (Nat.zero_le _) ht⟩ . intro _ t ht;rw [ZeF (α:=Nat) _ _ _ ht] . intro _ t ht;rw [ZeF (α:=Nat) _ _ _ ht] . rfl . rfl lemma ZLj (x g b:Array ο) (n rows r b0:Nat) (S1:Int) (dw:ο) (mean:Unit-> ℚ) (nU b0U:ו) (S1n:Bool) (S1a:ו) (f:Nat-> Nat-> ο) (hr:r< rows) (hf:∀ c,c< n-> Ya7G n x[r*n+c]! g[c]! b[c]! b0 S1 dw mean nU b0U S1n S1a=f r c) : ∀ (D j:Nat) (out:Array ο),n-j=D-> j<= n-> outڑ=rows*n -> (∀ q,q< rows*n-> (q/n< r\/(q/n=r/\q%n< j))-> out[q]! =f (q/n) (q%n)) -> (LNj x g b n (r*n) b0 S1 dw mean nU b0U S1n S1a j out)ڑ=rows*n /\ ∀ q,q< rows*n-> q/n< r+1-> (LNj x g b n (r*n) b0 S1 dw mean nU b0U S1n S1a j out)[q]! =f (q/n) (q%n):=by intro D induction D with | zero=> intro j out hD hj hs hv rw [LNj,ب א] refine ⟨hs,λ q hq hc=>hv q hq ?_⟩ have h0:0< n:=Ο (by rintro rfl;simp at hq) have:=Ρ q h0;omega | succ D ih=> intro j out hD hj hs hv have hj':j< n:=א have h0:0< n:=א rw [LNj,ة hj'] apply ih (j+1) _ א א (by simp [hs]) intro q hq hc rw [ZSb _ _ _ _ (by rw [hs];exact hq)] by_cases e1:r*n+j=q . rw [ة e1,<- e1,(ZQd _ _ _ hj').1,(ZQd _ _ _ hj').2];exact hf _ hj' . rw [ب e1];apply hv q hq have z1:¬ (q/n=r/\q%n=j):=λ h=>e1 ((ZQe q n r j hj' h0).mpr h).symm rcases hc with hc|⟨hc1,hc2⟩ . exact Or.inl hc . right;refine ⟨hc1,?_⟩;have:q%n≠j:=λ h=>z1 ⟨hc1,h⟩;omega lemma ZLr (x g b:Array ο) (n rows:Nat) (nU:ו) (st:Array (Nat×Int×ο)) (aux:Array (Bool×ו×ו)) (f:Nat-> Nat-> ο) (hf:∀ r c,r< rows-> c< n-> Ya7G n x[r*n+c]! g[c]! b[c]! st[r]!.1 st[r]!.2.1 st[r]!.2.2 (λ _=>Ϯ n x r) nU aux[r]!.2.2 aux[r]!.1 aux[r]!.2.1=f r c) : ∀ (D r:Nat) (out:Array ο),rows-r=D-> outڑ=rows*n -> (∀ q,q< rows*n-> q/n< r-> out[q]! =f (q/n) (q%n)) -> (LNr x g b n rows nU st aux r out)ڑ=rows*n /\ ∀ q,q< rows*n-> (LNr x g b n rows nU st aux r out)[q]! =f (q/n) (q%n):=by intro D induction D with | zero=> intro r out hD hs hv rw [LNr,ب א] exact ⟨hs,λ q hq=>hv q hq (by have:=ϡ (show q< n*rows by rw [Μ];exact hq);omega)⟩ | succ D ih=> intro r out hD hs hv rw [LNr,ة א];dsimp only obtain ⟨a1,a2⟩:=ZLj x g b n rows r st[r]!.1 st[r]!.2.1 st[r]!.2.2 (λ _=>Ϯ n x r) nU aux[r]!.2.2 aux[r]!.1 aux[r]!.2.1 f א (λ c hc=>hf r c א hc) _ 0 out rfl א hs (λ q hq hc=>hv q hq א) exact ih (r+1) _ א a1 a2 lemma ZdN:YbcN=Ybc:=by funext rows n eps x g b;unfold YbcN Ybc;rw [show Y8fL=Y8f from funext λ x=>funext λ n=>funext λ eps=>funext λ r=>ZY8L x n eps r];split . dsimp only;rw [ZB rows n _ rfl] obtain ⟨a1,a2⟩:=ZLr x g b n rows (if n<4096 then nڈ else 0) (ς (n:=rows) λ r=>Y8f x n eps rک) (ς (n:=rows) λ r=>let s:=(ς (n:=rows) λ r=>Y8f x n eps rک)[rک]!;let a:=s.2.1.natAbs;((!(s.2.1<0)),(if a>>>60 == 0 then aڈ else 0x1000000000000000),s.1.toUInt64)) (λ r c=>Ya7G n x[r*n+c]! g[c]! b[c]! (ς (n:=rows) λ r=>Y8f x n eps rک)[r]!.1 (ς (n:=rows) λ r=>Y8f x n eps rک)[r]!.2.1 (ς (n:=rows) λ r=>Y8f x n eps rک)[r]!.2.2 (λ _=>Ϯ n x r) (if n<4096 then nڈ else 0) (ς (n:=rows) λ r=>let s:=(ς (n:=rows) λ r=>Y8f x n eps rک)[rک]!;let a:=s.2.1.natAbs;((!(s.2.1<0)),(if a>>>60 == 0 then aڈ else 0x1000000000000000),s.1.toUInt64))[r]!.2.2 (ς (n:=rows) λ r=>let s:=(ς (n:=rows) λ r=>Y8f x n eps rک)[rک]!;let a:=s.2.1.natAbs;((!(s.2.1<0)),(if a>>>60 == 0 then aڈ else 0x1000000000000000),s.1.toUInt64))[r]!.1 (ς (n:=rows) λ r=>let s:=(ς (n:=rows) λ r=>Y8f x n eps rک)[rک]!;let a:=s.2.1.natAbs;((!(s.2.1<0)),(if a>>>60 == 0 then aڈ else 0x1000000000000000),s.1.toUInt64))[r]!.2.1) (λ r c _ _=>rfl) _ 0 (Θ (rows*n) 0) rfl ג (λ q _ h=>absurd h (Nat.not_lt_zero _)) apply Array.ext (by rw [a1];simp) intro q h1 h2 rw [<- ح _ q h1,a2 q (by rw [a1] at h1;exact h1)];simp . rfl def kernels:Kernels where core:=specCore dense:=⟨YaVM,Ya3M⟩ conv:=specConv elem:=⟨avgpoolSpec,maxpoolSpec,Ybf,scaleShiftSpec⟩ norm:=⟨rmsnormSpec,YbcN⟩ theorem correct:Obligation kernels:=by simp only [Obligation,kernels,specKernels,specDense,specElem,specNorm,ZMV0,ZcC,ZM3,Zc0,ZdC,ZdN,Zdt] end Submission