math / data /lean /OAI /Computability /DegreeRigidity /Constructibility /ParameterPersistentCollapse.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
2.2 kB
import OAI.Computability.DegreeRigidity.Representation.ParameterCoveringModels
import OAI.Computability.DegreeRigidity.Representation.GroundDegreeCollapse
namespace OAI
namespace TuringRigidity.BoundedSetTheory
open TransitiveNameModel PersistentRestrictions PersistentPresentation PersistentCountability OracleJump
open CountableForcing ElementaryModel
universe u
attribute [local instance] InternalCollapse.order InternalCollapse.collapsePreorder
theorem parameter_persistent_collapse (Ο€ : Degree ≃o Degree) (A : β„• β†’ Oracle) :
βˆƒ M : ZFSet.{u}, Transitive M ∧ SourceT M ∧ Countable (Conditions M) ∧
(βˆ€ n, A n ∈ modelReals M) ∧
βˆƒ c ∈ M, βˆƒ G : GenericFilter (Conditions c), AtomicForcing.GroundGeneric M G ∧
let N := genericExtensionSet M c G.carrier
M βŠ† N ∧ Transitive N ∧ SourceT N ∧
βˆƒ I : CountableIdeal, βˆƒ H ∈ modelReals N, βˆƒ hH : Presented I H,
(βˆ€ a : Degree, a ∈ I.carrier ↔ βˆƒ X ∈ modelReals M, degree X = a) ∧
(βˆ€ n, degree (A n) ∈ I.carrier) ∧
βˆƒ ρ : I ≃o I, RestrictsTo Ο€ I ρ ∧ Persistent I ρ ∧
graphOracle hH ρ ∈ modelReals N ∧
βˆƒ S ∈ N, degreeUniverse S ∈ N ∧ degreeOrder S ∈ N ∧
presentationGraph S H (graphOracle hH ρ) ∈ N ∧
(LevySigma.persistent 0 1 2 3 4).Realize N
(modelDegreeEnv S (presentationSet S H) (presentationGraph S H (graphOracle hH ρ))) := by
obtain ⟨X,hX⟩ := degree_surjective (Ο€ (degree (jump FixedArithmetic.zero)))
obtain ⟨Y,hY⟩ := degree_surjective (Ο€.symm (degree (jump FixedArithmetic.zero)))
let B : β„• β†’ Oracle | 0 => X | 1 => Y | n+2 => A n
obtain ⟨M,hM,hT,hcount,hB⟩ := parameter_covering_models.{u} B
let : Countable (Conditions M) := hcount
obtain ⟨c,hc,G,hG,hMN,hN,hTN,I,H,hHN,hH,hI,ρ,hρ,hp,hRN,S,hSN,hU,hO,hgraph⟩ :=
ground_degree_persistent_collapse M hM hT Ο€ X Y (hB 0) (hB 1) hX hY
refine ⟨M,hM,hT,hcount,(fun n => hB (n+2)),c,hc,G,hG,hMN,hN,hTN,
I,H,hHN,hH,hI,?_,ρ,hρ,hp,hRN,S,hSN,hU,hO,hgraph⟩
intro n
exact (hI _).mpr ⟨A n,hB (n+2),rfl⟩
end TuringRigidity.BoundedSetTheory
end OAI