introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
4.28 kB
import Mathlib
import OAI.MathematicalPhysics.RecorderFlows.Observation
namespace OAI
/-! Finite oracle programs and effective mixed-derivative evaluation. -/
namespace Solenoidal
namespace Effective
inductive OracleCode
| zero | succ | left | right | query
| pair (f g : OracleCode)
| comp (f g : OracleCode)
| prec (f g : OracleCode)
| rfind (f : OracleCode)
noncomputable def OracleCode.eval (o : β„• β†’ β„•) : OracleCode β†’ β„• β†’ Part β„•
| .zero => fun _ => .some 0
| .succ => fun n => .some (n + 1)
| .left => fun n => .some n.unpair.1
| .right => fun n => .some n.unpair.2
| .query => fun n => .some (o n)
| .pair f g => fun n => Nat.pair <$> f.eval o n <*> g.eval o n
| .comp f g => fun n => g.eval o n >>= f.eval o
| .prec f g => fun n =>
let (a, k) := n.unpair
k.rec (f.eval o a) fun j ih => do
let b ← ih
g.eval o (Nat.pair a (Nat.pair j b))
| .rfind f => fun a => Nat.rfind fun n => (fun k => k = 0) <$> f.eval o (Nat.pair a n)
def decodeRat (n : β„•) : β„š := (Encodable.decode (Ξ± := β„š) n).getD 0
noncomputable def tolerance (n : β„•) : ℝ := ((2 : ℝ) ^ n)⁻¹
def Names (x : ℝ) (o : β„• β†’ β„•) : Prop :=
βˆ€ n : β„•, |(decodeRat (o n) : ℝ) - x| ≀ tolerance n
def ComputableReal (x : ℝ) : Prop :=
βˆƒ c : Nat.Partrec.Code, βˆ€ n : β„•, βˆƒ a : β„•,
a ∈ c.eval n ∧ |(decodeRat a : ℝ) - x| ≀ tolerance n
def NamesArguments (Ξ½ : ℝ) (p : Fluid.SpaceTime) (o : β„• β†’ β„•) : Prop :=
Names ν (fun n => o (Nat.pair 0 n)) ∧
βˆ€ i : Fin 4, Names (p i) (fun n => o (Nat.pair (i.val + 1) n))
def machineCode (M : Machine) : β„• :=
let qs := List.finRange (M.states + 1)
let as := List.finRange (M.symbols + 1)
let moves : Move β†’ β„• := fun | .left => 0 | .stay => 1 | .right => 2
let table := qs.flatMap fun q => as.map fun a =>
let r := M.table q a
(r.1.val, r.2.1.val, moves r.2.2)
Encodable.encode (M.states, M.symbols, M.initial.val, M.blank.val, qs.map M.halt, table)
def wordCode {M : Machine} (w : List M.Symbol) : β„• :=
Encodable.encode (w.map Fin.val)
def request (M : Machine) (w : List M.Symbol) (a : List (Fin 4)) (j : Fin 3) (n : β„•) : β„• :=
Encodable.encode (machineCode M, wordCode w, a.map Fin.val, j.val, n)
def boundRequest (M : Machine) (w : List M.Symbol) (a : List (Fin 4)) (R : β„•) : β„• :=
Encodable.encode (machineCode M, wordCode w, a.map Fin.val, R)
abbrev ForceFamily := (Ξ½ : ℝ) β†’ (M : Machine) β†’ List M.Symbol β†’ Fluid.Field
def RelativeEffective (F : ForceFamily) (eval bounds : OracleCode) : Prop :=
(βˆ€ (Ξ½ : ℝ), 0 < Ξ½ β†’ βˆ€ (M : Machine) (w : List M.Symbol) (p : Fluid.SpaceTime),
0 ≀ p 0 β†’ βˆ€ o : β„• β†’ β„•, NamesArguments Ξ½ p o β†’
βˆ€ (a : List (Fin 4)) (j : Fin 3) (n : β„•), βˆƒ r : β„•,
r ∈ eval.eval o (request M w a j n) ∧
|(decodeRat r : ℝ) - Fluid.mixedD a (F Ξ½ M w) p j| ≀ tolerance n) ∧
(βˆ€ (Ξ½ : ℝ), 0 < Ξ½ β†’ βˆ€ o : β„• β†’ β„•, Names Ξ½ o β†’
βˆ€ (M : Machine) (w : List M.Symbol) (a : List (Fin 4)) (R : β„•), βˆƒ C : β„•,
C ∈ bounds.eval o (boundRequest M w a R) ∧
βˆ€ p : Fluid.SpaceTime, 0 ≀ p 0 β†’ (βˆ€ i, |p i| ≀ (R : ℝ)) β†’
β€–Fluid.mixedD a (F Ξ½ M w) pβ€– ≀ (C : ℝ))
def SuppliesArgument (c : Nat.Partrec.Code) (p : Fluid.SpaceTime) : Prop :=
βˆ€ (i : Fin 4) (n : β„•), βˆƒ r : β„•, r ∈ c.eval (Nat.pair i.val n) ∧
|(decodeRat r : ℝ) - p i| ≀ tolerance n
def EffectiveAt (F : ForceFamily) (Ξ½ : ℝ) : Prop :=
βˆƒ eval bounds : Nat.Partrec.Code,
(βˆ€ (M : Machine) (w : List M.Symbol) (p : Fluid.SpaceTime), 0 ≀ p 0 β†’
βˆ€ c : Nat.Partrec.Code, SuppliesArgument c p β†’
βˆ€ (a : List (Fin 4)) (j : Fin 3) (n : β„•), βˆƒ r : β„•,
r ∈ eval.eval (Nat.pair (request M w a j n) (Encodable.encode c)) ∧
|(decodeRat r : ℝ) - Fluid.mixedD a (F Ξ½ M w) p j| ≀ tolerance n) ∧
(βˆ€ (M : Machine) (w : List M.Symbol) (a : List (Fin 4)) (R : β„•), βˆƒ C : β„•,
C ∈ bounds.eval (boundRequest M w a R) ∧
βˆ€ p : Fluid.SpaceTime, 0 ≀ p 0 β†’ (βˆ€ i, |p i| ≀ (R : ℝ)) β†’
β€–Fluid.mixedD a (F Ξ½ M w) pβ€– ≀ (C : ℝ))
end Effective
end Solenoidal
end OAI