math / data /lean /OAI /Computability /DegreeRigidity /Constructibility /ParameterPersistentCollapse.lean
Download data/lean/OAI/Computability/DegreeRigidity/Constructibility/ParameterPersistentCollapse.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 2.2 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Computability/DegreeRigidity/Constructibility/ParameterPersistentCollapse.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Computability/DegreeRigidity/Constructibility/ParameterPersistentCollapse.lean
-
curl -L -o ParameterPersistentCollapse.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Computability/DegreeRigidity/Constructibility/ParameterPersistentCollapse.lean
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 | |