math / data /lean /OAI /Computability /MatchingCount /DivisionRoutine.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
2.42 kB
import OAI.Computability.MatchingCount.ArgRoutine
namespace OAI
section
namespace BinaryMatching.StackCode
open Polynomial
namespace Poly
@[fun_prop] theorem intDivNat : Poly (fun z : β„€Γ—β„• => z.1/(z.2:β„€)) := by
have h : Poly (fun z : β„€Γ—β„• => if decide (z.2=0) then (0:β„€) else
if decide (z.1<0) then -(((z.1.natAbs-1)/z.2+1:β„•):β„€)
else ((z.1.natAbs/z.2:β„•):β„€)) := by fun_prop
exact h.congr (fun z => by
by_cases hd : z.2=0
Β· simp [hd]
Β· have hp : (0:β„€)<z.2 := by exact_mod_cast (Nat.pos_of_ne_zero hd)
simp only [hd,decide_false,Bool.false_eq_true,ite_false,decide_eq_true_eq]
by_cases ha : z.1<0
Β· rw [ite_eq_left ha]
change -(((z.1.natAbs-1)/z.2+1:β„•):β„€)=Int.ediv z.1 (z.2:β„€)
rw [Int.ediv_of_neg_of_pos ha hp]
have ha' : 0<z.1.natAbs := Int.natAbs_pos.mpr (ne_of_lt ha)
have habs : (z.1.natAbs:β„€) = -z.1 := by omega
rw [Nat.cast_add,Nat.cast_one,Int.natCast_ediv,Nat.cast_sub (by omega : 1≀z.1.natAbs),Nat.cast_one,habs]
Β· rw [ite_eq_right ha,Int.natCast_ediv,Int.natAbs_of_nonneg (le_of_not_gt ha)])
end Poly
def cappedDouble (z : β„•Γ—β„•) : β„•Γ—β„• := (z.1,min z.1 (2*z.2))
lemma cappedDouble_bound (z : β„•Γ—β„•) (k : β„•) :
(cappedDouble^[k] z).1=z.1 ∧ (cappedDouble^[k] z).2≀z.1+z.2 := by
induction k with
| zero => simp
| succ k ih =>
rw [Function.iterate_succ_apply']
constructor
Β· exact ih.1
Β· dsimp only [cappedDouble]
rw [ih.1]
exact (Nat.min_le_left _ _).trans (Nat.le_add_right _ _)
lemma cappedDouble_iterate (cap k : β„•) :
cappedDouble^[k] (cap,min cap 1)=(cap,min cap (2^k)) := by
induction k with
| zero => simp
| succ k ih =>
rw [Function.iterate_succ_apply',ih]
simp only [cappedDouble,pow_succ]
congr 1
omega
namespace Poly
@[fun_prop] theorem pow2Capped : Poly (fun z : β„•Γ—β„• => min z.1 (2^z.2)) := by
have hs : Poly cappedDouble := by unfold cappedDouble; fun_prop
have hi := boundedIterate cappedDouble hs (2*X) (by
intro z j hj
have hb := cappedDouble_bound z.2 j
simp only [encode_prod,pairBits_length,encode_nat,unary_length,eval_mul,eval_ofNat,eval_X]
omega)
have h : Poly (fun z : β„•Γ—β„• => (cappedDouble^[z.2] (z.1,min z.1 1)).2) := by fun_prop
exact h.congr (fun z => by rw [cappedDouble_iterate])
end Poly
end BinaryMatching.StackCode
end
end OAI