File size: 5,725 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 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 | import OAI.Computability.DegreeRigidity.SetModels.ModelDegreeUniverse
import OAI.Computability.DegreeRigidity.SetModels.InternalPresentationEnumeration
namespace OAI
namespace TuringRigidity.BoundedSetTheory
open TransitiveNameModel EncodedForcing
universe u
namespace Formula
def selectedEnumerationBit (o Q I E F v : β) : Formula :=
.existsMem o (.existsMem (o+1) (.conj (naturalPair (o+2) (Q+2) 1 0 (v+2))
(.existsMem (I+2) (.conj (.pairMem 2 0 (E+3))
(.existsMem 0 (.conj (.pairMem 1 0 (F+4)) (.member 2 0)))))))
theorem selectedEnumerationBit_spec (o Q I E F v : β) (e : β β ZFSet.{u})
(ho : e o = ZFSet.omega) (hQ : β f : β β β, β k, finiteNaturalGraph f k β e Q)
(N K : β) (hv : e v = natSet (Nat.pair N K)) :
(selectedEnumerationBit o Q I E F v).Eval e β
β D β e I, ZFSet.pair (natSet N) D β e E β§
β A β D, ZFSet.pair D A β e F β§ natSet K β A := by
simp only [selectedEnumerationBit,Formula.Eval,eval_pairMem,cons_zero,cons_succ]
rw [ho]
constructor
Β· rintro β¨n,hn,k,hk,hp,hrestβ©
obtain β¨n,rflβ© := (mem_omega n).mp hn
obtain β¨k,rflβ© := (mem_omega k).mp hk
have hp' := (naturalPair_spec (o+2) (Q+2) 1 0 (v+2)
(cons (natSet k) (cons (natSet n) e)) ho hQ n k rfl rfl).mp hp
have hnk : Nat.pair N K = Nat.pair n k := natSet_injective (hv.symm.trans hp')
have he := congrArg Nat.unpair hnk
simp only [Nat.unpair_pair,Prod.mk.injEq] at he
obtain β¨rfl,rflβ© := he
exact hrest
Β· intro h
refine β¨natSet N,(mem_omega _).mpr β¨N,rflβ©,natSet K,(mem_omega _).mpr β¨K,rflβ©,?_,hβ©
exact (naturalPair_spec (o+2) (Q+2) 1 0 (v+2)
(cons (natSet K) (cons (natSet N) e)) ho hQ N K rfl rfl).mpr hv
end Formula
theorem internal_selected_enumeration_real (M : ZFSet.{u}) (hM : Transitive M) (hT : SourceT M)
{I E F : ZFSet.{u}} (hIM : I β M) (hEM : E β M) (hFM : F β M)
(hE : TransitiveNameModel.FunctionGraph ZFSet.omega I E) (hF : ChoiceGraph I F) :
β H β modelReals M, β n, β D β I, ZFSet.pair (natSet n) D β E β
β A : Oracle, realCode A β D β ZFSet.pair D (realCode A) β F β columns H n = A := by
have hS := hT.separation.finitePrefix.bounded
have hΟ := sourceT_omega_mem M hM hT
obtain β¨Q,hQM,_,hQβ© := internal_finite_natural_graph_bound M hM hT.pairing hT.union hT.powerSet hS hΟ
let e := cons ZFSet.omega (cons Q (cons I (cons E (fun _ => F))))
have he : β i, e i β M := by
intro i
rcases i with _|i; exact hΟ
rcases i with _|i; exact hQM
rcases i with _|i; exact hIM
rcases i with _|i; exact hEM
exact hFM
let B := ZFSet.sep (fun v => (Formula.selectedEnumerationBit 1 2 3 4 5 0).Eval (cons v e)) ZFSet.omega
have hBM : B β M := sep_mem M hM hS _ e he hΟ
have hsub : B β ZFSet.omega := fun _ h => (ZFSet.mem_sep.mp h).1
have hB : realCode (decodeReal B) = B := realCode_decodeReal hsub
refine β¨decodeReal B,?_,?_β©
Β· change realCode (decodeReal B) β M
rw [hB]; exact hBM
Β· intro n D hD hn A hA hDA
funext k
have hbit : columns (decodeReal B) n k = true β A k = true := by
change decodeReal B (Nat.pair n k) = true β A k = true
rw [decodeReal_true]
change natSet (Nat.pair n k) β ZFSet.sep _ ZFSet.omega β _
rw [ZFSet.mem_sep,Formula.selectedEnumerationBit_spec 1 2 3 4 5 0
(cons (natSet (Nat.pair n k)) e) rfl hQ n k rfl]
constructor
Β· rintro β¨_,D',_,hn',A',_,hDA',hkβ©
have hDD := hE.functional ((mem_omega _).mpr β¨n,rflβ©) hn hn'
subst D'
have hAA := hF.functional hDA hDA'
rw [βhAA,natSet_mem_realCode] at hk
exact hk
Β· intro hk
exact β¨(mem_omega _).mpr β¨Nat.pair n k,rflβ©,D,hD,hn,realCode A,hA,hDA,
(natSet_mem_realCode A k).mpr hkβ©
cases hx : columns (decodeReal B) n k <;> cases hy : A k <;> simp_all
def InternallyCountable (M I : ZFSet.{u}) : Prop :=
β E β M, TransitiveNameModel.FunctionGraph ZFSet.omega I E β§
β D β I, β n β ZFSet.omega, ZFSet.pair n D β E
theorem internal_countable_degree_presentation (M : ZFSet.{u}) (hM : Transitive M) (hT : SourceT M)
(R : ZFSet.{u}) (hR : β w β R, β A : Oracle, realCode A = w)
{I : ZFSet.{u}} (hIM : I β M) (hI : I β degreeUniverse R)
(hcount : InternallyCountable M I) :
β H β modelReals M, presentationSet R H = I := by
obtain β¨E,hEM,hE,hontoβ© := hcount
obtain β¨F,hFM,hFβ© := hT.choice I hIM (fun D hD => by
obtain β¨A,hA,_β© := degreeUniverse_nonempty_member R D (hI hD)
exact β¨realCode A,hAβ©)
obtain β¨H,hHM,hHβ© := internal_selected_enumeration_real M hM hT hIM hEM hFM hE hF
have hentry (n : β) (D : ZFSet.{u}) (hD : D β I) (hn : ZFSet.pair (natSet n) D β E) :
degreeCode R (columns H n) = D := by
obtain β¨a,ha,hDa,_β© := hF.2 D hD
obtain β¨B,hB,hDBβ© := (mem_degreeUniverse R D).mp (hI hD)
have har : a β R := degreeCode_subset R B (hDB βΈ ha)
obtain β¨A,rflβ© := hR a har
rw [hH n D hD hn A ha hDa]
have heq := ((realCode_mem_degreeCode R B A).mp (hDB βΈ ha)).2
exact ((degreeCode_equal R har).mpr heq).trans hDB.symm
refine β¨H,hHM,?_β©
apply ZFSet.ext; intro D
constructor
Β· intro hD
obtain β¨n,rflβ© := (mem_presentationSet R H D).mp hD
obtain β¨D,hD,hn,_β© := hE.2 (natSet n) ((mem_omega _).mpr β¨n,rflβ©)
rw [hentry n D hD hn]
exact hD
Β· intro hD
obtain β¨n,hn,hDnβ© := honto D hD
obtain β¨n,rflβ© := (mem_omega n).mp hn
exact (mem_presentationSet R H D).mpr β¨n,(hentry n D hD hDn).symmβ©
end TuringRigidity.BoundedSetTheory
end OAI
|