introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
1.5 kB
import OAI.Computability.DegreeRigidity.SetModels.IdealSelection
namespace OAI
namespace TuringRigidity
theorem representative_from_generic_coding (Ο€ : Degree ≃o Degree)
(F : Oracle β†’ Oracle) (hF : Measurable F)
(C : Oracle β†’ Oracle β†’ Oracle) (hC : Measurable (Function.uncurry C))
(G : Bool β†’ Oracle β†’ Oracle) (hG : βˆ€ b, Measurable (G b))
(hgen : βˆ€ A b, degree (F (G b A)) = Ο€ (degree (G b A)))
(hcoded : βˆ€ A b, degree (F (C A (G b A))) = Ο€ (degree (C A (G b A))))
(hideal : βˆ€ A a, a ≀ degree A ↔
a ≀ degree (join (C A (G false A)) (G false A)) ∧
a ≀ degree (join (C A (G true A)) (G true A))) :
βˆƒ H : Oracle β†’ Oracle, Measurable H ∧ βˆ€ A, degree (H A) = Ο€ (degree A) := by
let L : Bool β†’ Oracle β†’ Oracle := fun b A => join (F (C A (G b A))) (F (G b A))
have hL (b : Bool) : Measurable (L b) :=
join_measurable _ _ (hF.comp (hC.comp (measurable_id.prodMk (hG b)))) (hF.comp (hG b))
have hdegree (A : Oracle) (b : Bool) :
degree (L b A) = Ο€ (degree (join (C A (G b A)) (G b A))) := by
dsimp only [L]
change degree (F (C A (G b A))) βŠ” degree (F (G b A)) =
Ο€ (degree (C A (G b A)) βŠ” degree (G b A))
rw [hcoded A b, hgen A b, Ο€.map_sup]
apply borel_of_ideal_intersection (L false) (L true) (hL false) (hL true)
(fun A => Ο€ (degree A))
intro A a
rw [hdegree A false,hdegree A true]
exact common_lower_transport Ο€ _ _ _ (hideal A) a
end TuringRigidity
end OAI