File size: 3,762 Bytes
4a56cd6
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
import OAI.MathematicalPhysics.RapidForcing.RatComputable
import OAI.MathematicalPhysics.RapidForcing.ComputableAutomation

namespace OAI

section
open Encodable Denumerable
namespace RapidForcing.EffectiveArithmetic

lemma rat_divInt_graph (n d : β„€) (q : β„š) (hd : d β‰  0) :
    q.num * d = n * (q.den : β„€) ↔ q = (n : β„š) / d := by
  have hq : (q.den : β„š) β‰  0 := by exact_mod_cast q.den_nz
  have hd' : (d : β„š) β‰  0 := by exact_mod_cast hd
  conv_rhs => rw [← Rat.num_div_den q, div_eq_div_iff hq hd']
  exact_mod_cast (Iff.rfl : q.num * d = n * (q.den : β„€) ↔ _)

@[fun_prop] lemma computable_rat_divInt : Computable (fun p : β„€ Γ— β„€ => (p.1 : β„š) / p.2) := by
  apply computable_of_graph _ (fun p q =>
      if p.2 = 0 then q = 0 else q.num * p.2 = p.1 * (q.den : β„€))
  Β· have hi : PrimrecPred (fun p : (β„€ Γ— β„€) Γ— β„š =>
        (p.1.2 = 0 ∧ p.2 = 0) ∨ (p.1.2 β‰  0 ∧ p.2.num * p.1.2 = p.1.1 * (p.2.den : β„€))) := by fun_prop
    exact hi.of_eq (fun p => by split_ifs <;> simp_all)
  Β· intro p q
    split_ifs with hd
    Β· simp [hd]
    Β· exact rat_divInt_graph _ _ _ hd

@[fun_prop] lemma computable_rat_inv : Computable (fun q : β„š => q⁻¹) := by
  have := computable_rat_divInt.comp (show Computable (fun q : β„š => ((q.den : β„€), q.num)) by fun_prop)
  exact this.of_eq (fun q => by simpa [Int.cast_natCast, inv_div] using congrArg Inv.inv (Rat.num_div_den q))

@[fun_prop] lemma computable_rat_div : Computable (fun p : β„š Γ— β„š => p.1 / p.2) := by
  simpa [div_eq_mul_inv] using (show Computable (fun p : β„š Γ— β„š => p.1 * p.2⁻¹) by fun_prop)

@[fun_prop] lemma computable_rat_abs : Computable (fun q : β„š => |q|) := by
  apply Computable.of_eq (show Computable (fun q : β„š => if 0 ≀ q then q else -q) by fun_prop)
  intro q
  split_ifs with h
  Β· exact (abs_of_nonneg h).symm
  Β· exact (abs_of_neg (lt_of_not_ge h)).symm

@[fun_prop] lemma computable_rat_max : Computable (fun p : β„š Γ— β„š => max p.1 p.2) := by
  simpa only [max_def] using (show Computable (fun p : β„š Γ— β„š => if p.1 ≀ p.2 then p.2 else p.1) by fun_prop)

@[fun_prop] lemma computable_rat_pow : Computable (fun p : β„š Γ— β„• => p.1 ^ p.2) := by
  have h := Computable.nat_rec (f := fun p : β„š Γ— β„• => p.2)
    (g := fun _ => (1 : β„š)) (h := fun p r => r.2 * p.1)
    (by fun_prop) (by fun_prop) (by unfold Computableβ‚‚; fun_prop)
  apply h.of_eq
  intro p
  induction p.2 <;> simp [pow_succ, *]

@[fun_prop] lemma computable_rat_natCeil : Computable (fun q : β„š => ⌈qβŒ‰β‚Š) := by
  apply computable_of_compGraph _ (fun q n : _ =>
      if n = (0 : β„•) then q ≀ 0 else (n - 1 : β„š) < q ∧ q ≀ (n : β„š))
  Β· have hi : CompPred (fun p : β„š Γ— β„• =>
        (p.2 = 0 ∧ p.1 ≀ 0) ∨ (p.2 β‰  0 ∧ (p.2 - 1 : β„š) < p.1 ∧ p.1 ≀ (p.2 : β„š))) := by fun_prop
    exact hi.of_eq (fun p => by split_ifs <;> simp_all)
  Β· intro q n
    by_cases hn : n = 0
    Β· simp [hn, eq_comm, Nat.ceil_eq_zero]
    Β· simp only [ite_eq_right hn]
      rw [eq_comm, Nat.ceil_eq_iff hn]
      simp only [Nat.cast_sub (Nat.one_le_iff_ne_zero.mpr hn), Nat.cast_one]

@[fun_prop] lemma computable_rat_natFloor : Computable (fun q : β„š => ⌊qβŒ‹β‚Š) := by
  apply computable_of_compGraph _ (fun q n : _ =>
      if n = (0 : β„•) then q < 1 else (n : β„š) ≀ q ∧ q < (n : β„š) + 1)
  Β· have hi : CompPred (fun p : β„š Γ— β„• =>
        (p.2 = 0 ∧ p.1 < 1) ∨ (p.2 β‰  0 ∧ (p.2 : β„š) ≀ p.1 ∧ p.1 < (p.2 : β„š) + 1)) := by fun_prop
    exact hi.of_eq (fun p => by split_ifs <;> simp_all)
  Β· intro q n
    by_cases hn : n = 0
    Β· simp [hn, eq_comm, Nat.floor_eq_zero]
    Β· simp only [ite_eq_right hn]
      rw [eq_comm, Nat.floor_eq_iff' hn]

end RapidForcing.EffectiveArithmetic

end

end OAI