effective reducibility for smooth and analytic
play

Effective Reducibility for Smooth and Analytic Equivalence Relations - PowerPoint PPT Presentation

. Effective Reducibility for Smooth and Analytic Equivalence Relations on a Cone . . . Takayuki Kihara University of California, Berkeley, USA Joint Work with Antonio Montalb an (UC Berkeley) Computability Theory and Foundation of


  1. . Effective Reducibility for Smooth and Analytic Equivalence Relations on a Cone . . . Takayuki Kihara University of California, Berkeley, USA Joint Work with Antonio Montalb´ an (UC Berkeley) Computability Theory and Foundation of Mathematics 2015, Sep 2015 Takayuki Kihara (UC Berkeley) Effective Reducibility on a Cone

  2. . . Invariant descriptive set theory: 1 . . Computable structure theory: 2 . . . Takayuki Kihara (UC Berkeley) Effective Reducibility on a Cone

  3. . . Invariant descriptive set theory: classification of classification 1 problems of mathematical structures such as: Isomorphism relation on countable Boolean algebras. Isomorphism relation on countable p -groups. Isometry relation on Polish metric spaces. Linear isometry relation on separable Banach spaces. Isomorphism relation on separable C ∗ -algebras. Key notion: Borel reducibility among equivalence relations on Borel spaces. . . Computable structure theory: 2 . . . Takayuki Kihara (UC Berkeley) Effective Reducibility on a Cone

  4. . . Invariant descriptive set theory: classification of classification 1 problems of mathematical structures such as: Isomorphism relation on countable Boolean algebras. Isomorphism relation on countable p -groups. Isometry relation on Polish metric spaces. Linear isometry relation on separable Banach spaces. Isomorphism relation on separable C ∗ -algebras. Key notion: Borel reducibility among equivalence relations on Borel spaces. . . Computable structure theory: classification of classification 2 problems of computable structures such as: Isomorphism relation of computable trees. Isomorphism relation of computable torsion-free abelian grps Bi-embeddability relation of computable linear orders. Key notion: computable reducibility among equivalence relations on represented spaces . . . . Takayuki Kihara (UC Berkeley) Effective Reducibility on a Cone

  5. . . . . . . . ( X , δ ) is a represented space if δ : ⊆ N N → X is a partial surjection. A point x ∈ X is computable if it has a computable name, that is, there is a computable p ∈ δ − 1 { x } . . . . Takayuki Kihara (UC Berkeley) Effective Reducibility on a Cone

  6. . ( X , δ ) is a represented space if δ : ⊆ N N → X is a partial surjection. A point x ∈ X is computable if it has a computable name, that is, there is a computable p ∈ δ − 1 { x } . . . . . Example . . . The space of countable L -structures is represented: 1 For a countable relational language L = ( R i ) i ∈ N , each countable L -structure K with domain ⊆ ω is identified with its atomic diagram D ( K ) = ⊕ i ∈ N R K ∈ 2 ω . i For a class K of countable L -structures with δ : D ( K ) �→ K , ( K , δ ) forms a represented space. . . Polish spaces, second-countable T 0 space are represented. 2 . . Much more generally, every T 0 space with a countable 3 cs-network has a “universal” representation δ , i.e., for any representation δ ′ , there is a continuous map g such that δ ′ = δ ◦ g . . . . Takayuki Kihara (UC Berkeley) Effective Reducibility on a Cone

  7. . ( X , δ ) is a represented space if δ : ⊆ N N → X is a partial surjection. A point x ∈ X is computable if it has a computable name, that is, there is a computable p ∈ δ − 1 { x } . The e -th computable point of X = ( X , δ ) is denoted by Φ X e . . . . . Let E and F be equivalence relations on represented spaces X and Y , respectively. We say that E ≤ e ff F if there is a partial computable function f : ⊆ N → N such that for all i , j ∈ N with Φ X i , Φ X j ∈ dom ( δ X ) , Φ X i E Φ X Φ Y f ( i ) F Φ Y f ( j ) . ⇐ ⇒ j . . . . Let E and F be equivalence relations on Borel spaces X and Y , respectively. We say that E ≤ B F if there is a Borel function f : X → Y such that for all x , y ∈ X , xEy ⇐ ⇒ f ( x ) Ff ( y ) . . . . Takayuki Kihara (UC Berkeley) Effective Reducibility on a Cone

  8. . . . Today’s Theme . . “Effective reducibility on a cone” i.e., the oracle-relativized version of effective reducibility. . . . Takayuki Kihara (UC Berkeley) Effective Reducibility on a Cone

  9. . Today’s Theme . . “Effective reducibility on a cone” i.e., the oracle-relativized version of effective reducibility. . . . . The oracle relativization of a computability-theoretic concept sometimes has applications in other areas of mathematics which does NOT involve any notion concerning computability: . . . Takayuki Kihara (UC Berkeley) Effective Reducibility on a Cone

  10. . Today’s Theme . . “Effective reducibility on a cone” i.e., the oracle-relativized version of effective reducibility. . . . . The oracle relativization of a computability-theoretic concept sometimes has applications in other areas of mathematics which does NOT involve any notion concerning computability: (Gregoriades-K., K.-Ng) the Shore-Slaman join theorem / The Louveau separation theorem ⇝ a decomposition theorem for Borel measurable functions in descriptive set theory. . . . Takayuki Kihara (UC Berkeley) Effective Reducibility on a Cone

  11. . Today’s Theme . . “Effective reducibility on a cone” i.e., the oracle-relativized version of effective reducibility. . . . . The oracle relativization of a computability-theoretic concept sometimes has applications in other areas of mathematics which does NOT involve any notion concerning computability: (Gregoriades-K., K.-Ng) the Shore-Slaman join theorem / The Louveau separation theorem ⇝ a decomposition theorem for Borel measurable functions in descriptive set theory. (K.-Pauly) Turing degree spectrum / Scott ideals ( ω -models of WKL ) ⇝ a refinement of R. Pol’s solution to Alexandrov’s problem in infinite dimensional topology. . . . Takayuki Kihara (UC Berkeley) Effective Reducibility on a Cone

  12. . Today’s Theme . . “Effective reducibility on a cone” i.e., the oracle-relativized version of effective reducibility. . . . . The oracle relativization of a computability-theoretic concept sometimes has applications in other areas of mathematics which does NOT involve any notion concerning computability: (Gregoriades-K., K.-Ng) the Shore-Slaman join theorem / The Louveau separation theorem ⇝ a decomposition theorem for Borel measurable functions in descriptive set theory. (K.-Pauly) Turing degree spectrum / Scott ideals ( ω -models of WKL ) ⇝ a refinement of R. Pol’s solution to Alexandrov’s problem in infinite dimensional topology. (K.-Pauly) Turing degree spectrum / Scott ideals ⇝ a construction of linearly non-isometric (ring non-isomorphic, etc.) examples of Banach algebras of real-valued Baire n functions on Polish spaces. . . . Takayuki Kihara (UC Berkeley) Effective Reducibility on a Cone

  13. . Let E and F be equivalence relations on represented spaces X and Y , respectively. We say that E ≤ cone F if there is a partial e ff computable function f : ⊆ N → N such that ( ∃ r ∈ 2 ω )( ∀ z ≥ T r ) for all i , j ∈ N with Φ z , X , Φ z , X ∈ dom ( δ X ) , i j Φ z , X E Φ z , X Φ z , Y f ( i ) F Φ z , Y f ( j ) . ⇐ ⇒ i j . . . = E ≤ c F ⇒ E ≤ B F ⇓ ⇓ E ≤ cone E ≤ cone F = ⇒ hyp F e ff . E is said to be analytic ≤ cone e ff -complete if F ≤ cone E for any e ff analytic equivalence relation F . E is said to be ≤ cone e ff -intermediate if E is not analytic ≤ cone e ff -complete, and there is no Borel eq. relation F such that E ≤ cone F . . . . e ff Takayuki Kihara (UC Berkeley) Effective Reducibility on a Cone

  14. . . . . The Vaught Conjecture (1961) . . The number of countable models of a first-order theory is at most countable or 2 ℵ 0 . . . . . (The L ω 1 ω -Vaught conjecture) The number of countable models of an L ω 1 ω -theory is at most countable or 2 ℵ 0 . (Topological Vaught conjecture) The number of orbits of a continuous action of a Polish group on a standard Borel space is at most countable or 2 ℵ 0 . . . . Takayuki Kihara (UC Berkeley) Effective Reducibility on a Cone

  15. . The Vaught Conjecture (1961) . . The number of countable models of a first-order theory is at most countable or 2 ℵ 0 . . . . . (The L ω 1 ω -Vaught conjecture) The number of countable models of an L ω 1 ω -theory is at most countable or 2 ℵ 0 . (Topological Vaught conjecture) The number of orbits of a continuous action of a Polish group on a standard Borel space is at most countable or 2 ℵ 0 . . . . . Fact (Becker 2013; Knight and Montalb´ an) . Suppose that there is no L ω 1 ω -axiomatizable class of countable structures whose isomorphism relation is ≤ cone e ff -intermediate then, the L ω 1 ω -Vaught conjecture is true. Indeed, if there is no ≤ cone e ff -intermediate orbit equivalence relation then, the topological Vaught conjecture is true. . . . Takayuki Kihara (UC Berkeley) Effective Reducibility on a Cone

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend