File size: 4,723 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 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 | import OAI.Computability.DegreeRigidity.Constructibility.HierarchyGraph
import OAI.Computability.DegreeRigidity.Syntax.SigmaParameterizedClosure
import OAI.Computability.DegreeRigidity.SetModels.InternalHull
namespace OAI
namespace TuringRigidity.RelativeConstructible
open ElementaryModel BoundedSetTheory TransitiveNameModel SentenceCoding
open BoundedDefinability SetModelFunctions
universe u
variable {M : ZFSet.{u}}
theorem stageStep_definable (C : Context M) (s f r x A : β) :
Definable M (fun e => StageStep (e s) (e f) (e r) (e x) (e A)) := by
have hn := defAllMem (defOr (member_definable C 0 (s+1))
((((defPairMem C 1 0 (f+3)).and (member_definable C 2 0)).existsMem (r+2)).existsMem (x+1))) A
have hc := defAllMem (defAllMem (defImp (defPairMem C 1 0 (f+2))
(defSubset C 0 (A+2))) (r+1)) x
exact (defSubset C s A).and (hn.and hc)
theorem functionGraph_definable (C : Context M) (d r f : β) :
Definable M (fun e => FunctionGraph (e d) (e r) (e f)) := by
refine β¨.functionGraph (2*f) (2*d) (2*r),fun _ => ZFSet.omega,
fun _ => C.omega_mem,?_β©
intro e
simp only [Formula.eval_functionGraph,mix_even,FunctionGraph]
theorem hierarchyGraph_sigmaDefinable (hM : Transitive M) (hT : SourceT M) (s d r f : β) :
SigmaDefinable M (fun e => HierarchyGraph M (e s) (e d) (e r) (e f)) := by
let C : Context M := β¨hM,hT.pairing,hT.union,hT.powerSet,hT.separation.finitePrefix.bounded,hT.infinityβ©
have hd := (defAllMem (defSubset C 0 (d+1)) d).toSigma hM
have hf := (functionGraph_definable C d r f).toSigma hM
have hv : SigmaDefinable M (fun e => e 1 = definablePower (e 0)) :=
(definablePower_sigmaDefinable M hM hT).subst (fun i => if i = 0 then 1 else 0)
have hs := ((stageStep_definable C (s+3) (f+3) (r+3) 2 0).toSigma hM).and hv
have hi := SigmaDefinable.impBounded C (defPairMem C 1 0 (f+2)) hs.existsSet
exact hd.and (hf.and ((hi.allMem hM hT (r+1)).allMem hM hT d))
theorem sigma_binary_relation (P : ZFSet.{u} β ZFSet.{u} β Prop)
(h : SigmaDefinable M (fun e => P (e 1) (e 0))) :
β p : SigmaFormula, β a : β β ZFSet.{u}, (β i, a i β M) β§
β x β M, β y β M, p.Realize M (cons y (cons x a)) β P x y := by
obtain β¨p,a,ha,hpβ© := h
let r : β β β := fun i => if i % 2 = 0 then (if i / 2 = 0 then 0 else 1) else i/2+2
refine β¨p.rename r,a,ha,?_β©
intro x hx y hy
rw [SigmaFormula.realize_rename]
have he : cons y (cons x a) β r = mix (cons y (fun _ => x)) a := by
apply parity_ext
Β· intro n
cases n with
| zero => rfl
| succ n => simp [r,show Β¬ 2 * (n+1) β€ 1 by omega]
Β· intro n; simp [r,Nat.add_div]
change p.Realize M (cons y (cons x a) β r) β _
rw [he]
exact hp (cons y (fun _ => x)) (by intro i; cases i; exact hy; exact hx)
theorem uniform_hierarchy_certificate (M R d q : ZFSet.{u}) (hM : Transitive M)
(hT : SourceT M) (hs : seed R β M) (hdM : d β M) (hqM : q β M)
(hd : Transitive d) (hq : β c, c β q β c β M β§ c β d) :
β p : SigmaFormula, β a : β β ZFSet.{u}, (β i, a i β M) β§
β x β d, β f β M, p.Realize M (cons f (cons x a)) β
β r β M, HierarchyGraph M (seed R) (hull d q x) r f := by
let C : Context M := β¨hM,hT.pairing,hT.union,hT.powerSet,hT.separation.finitePrefix.bounded,hT.infinityβ©
have hh : Definable M (fun e => e 1 β q β§ Transitive (e 1) β§ e 3 β e 1 β§
β b β q, Transitive b β e 3 β b β e 1 β b) := by
refine β¨.isHull 2 6 1 3,cons d (fun _ => q),?_,?_β©
Β· intro i; cases i; exact hdM; exact hqM
Β· intro e
simp [Formula.eval_isHull,mix,cons]
have hg : SigmaDefinable M (fun e => HierarchyGraph M (seed R) (e 1) (e 0) (e 2)) := by
have h := hierarchyGraph_sigmaDefinable hM hT 0 2 1 3
have eq := (equal_param hs 0).toSigma hM
have hx := (eq.and h).existsSet
exact hx.congr (fun e _ => by simp [hs])
have hc := (hh.toSigma hM).and hg
obtain β¨p,a,ha,hpβ© := sigma_binary_relation (fun x f =>
β c β M, β r β M, (c β q β§ Transitive c β§ x β c β§
β b β q, Transitive b β x β b β c β b) β§ HierarchyGraph M (seed R) c r f)
hc.existsSet.existsSet
refine β¨p,a,ha,?_β©
intro x hx f hf
rw [hp x (hM d hdM x hx) f hf]
constructor
Β· rintro β¨c,hc,r,hr,hh,hgβ©
have he := (isHull_iff M d q hM C.separation hdM hqM hd hq hx hc).mp hh
subst c
exact β¨r,hr,hgβ©
Β· rintro β¨r,hr,hgβ©
have hc := hull_mem M d q hM C.separation hdM hqM (hM d hdM x hx)
exact β¨_,hc,r,hr,(isHull_iff M d q hM C.separation hdM hqM hd hq hx hc).mpr rfl,hgβ©
end TuringRigidity.RelativeConstructible
end OAI
|