diff f6bf760..6fbd3ac turing_degrees_rigidity_v2.txt
diff --git a/turing_degrees_rigidity_v2.txt b/turing_degrees_rigidity_v2.txt
index c1d77ac..e96f430 100644
--- a/turing_degrees_rigidity_v2.txt
+++ b/turing_degrees_rigidity_v2.txt
@@ -93,12 +93,12 @@ degree. The relation
degT AleTdegT B iff AleT B
]
is well defined and makes the set DT of all degrees a partial order,
-the Turing degrees. The least degree mathbf 0bf0 is the degree of
+the Turing degrees. The least degree 0bf0 is the degree of
the computable sets. Any two degrees have a least upper bound, the
-join mathbf abfaveemathbf b:bfb: it is the degree of
+join b:b: it is the degree of
A ⊕ B, where A ⊕ B interleaves the characteristic functions
of A and B. An oracle computes A ⊕ B exactly when it computes
-both A and B, so mathbf abfaveemathbf bbfb is indeed the least upper
+both A and B, so bbfb is indeed the least upper
bound. Finite joins are obtained by repeating this operation; the
result does not depend on the bracketing.
@@ -107,9 +107,9 @@ result does not depend on the bracketing.
An order automorphism of (DT,leT) is a bijection
pi:DTtoDT with
[
-mathbf abfaleTmathbf bbfb
+ bbfb
⇔
-pi(mathbf a)bfa)leTpi(mathbf b).bfb).
+pi(a)a)leTpi(b).b).
]
Such a pi is a symmetry of the information order: it may rename
degrees, but it must preserve every comparison. The rigidity conjecture
@@ -119,7 +119,7 @@ itself determines each degree. We prove it.
[Rigidity]
Every order automorphism pi of (DT,leT) is the identity:
[
-pi(mathbf a)=bfa)=mathbf abfa (mathbf abfainDT).
+pi(a)=a)=a (ainDT).
]
@@ -127,11 +127,11 @@ No definability, measurability, or continuity is assumed on pi; it is
an arbitrary bijection of a set of size 2^{aleph_0}.
Two remarks will be used without further comment. First, an order
-automorphism fixes mathbf 0,bf0, since mathbf 0bf0 is the unique least
+automorphism fixes 0,0, since 0bf0 is the unique least
element. Second, it preserves joins, since a join is a least upper bound
and least upper bounds are described purely in terms of leT. Thus
-pi(mathbf 0)=bf0)=mathbf 0bf0 and
-pi(mathbf abfaveemathbf b)=bfb)=pi(mathbf a)bfa)veepi(mathbf b).bfb).
+pi(0)=0)=0bf0 and
+pi( b)=b)=pi(a)a)veepi(b).b).
## The one external input
@@ -317,9 +317,9 @@ function valid at every input.
[Slaman--Woodin]
For every piinAut(DT,leT) there is an arithmetic function
-widehatwidehat F:2^F:2^Nto2^N with
+Fhat:2^F:2^Nto2^N with
[
-degT{widehatwidehat F(A)}F(A)=pi(degT A)
+degT{Fhat(A)}F(A)=pi(degT A)
for every A⊆N.
]
@@ -331,7 +331,7 @@ from, and weaker than, the all-input assertion used here.
Arithmetic refers to the graph of a single total function, which is
a Borel subset of 2^Ntimes2^N. By the Borel-graph criterion
-cite[Corollary~4.15]{MarkerDST}, widehatwidehat FF is Borel; the weaker Borel
+cite[Corollary~4.15]{MarkerDST}, FFhat is Borel; the weaker Borel
conclusion is also Corollary~4.25 in the author's version of
[cite].
@@ -345,7 +345,7 @@ F(x+y)&leT F(x) ⊕ F(y).
Proof.
-Let F=widehatwidehat FFcirc C, using Theorem~thm:representation and the
+Let F=FFcirchat C, using Theorem~thm:representation and the
cut map of Lemma~lem:cuts. As a composition of Borel maps, F is
Borel, and (eq:representation) holds by construction.
@@ -639,12 +639,12 @@ Lemma~lem:lift. Fix an irrational tin(0,1) and let G_t be the
comeager set of Proposition~prop:recovery. For (u,v)in G_t, let
delta be as in (eq:four-values) and put
[
-mathbf b=d(t)bfb=d(t)vee d(u)vee d(v).
+b=d(t)b=d(t)vee d(u)vee d(v).
]
Each of the four arguments in (eq:four-values) is a rational affine
combination of t,u,v, so by Lemma~lem:cuts its degree is at most
-mathbf b;bfb; by (eq:representation) the degree of its F-value is
-at most pi(mathbf b).bfb). The same bound holds for the finite join of the
+b;b; by (eq:representation) the degree of its F-value is
+at most pi(b).b). The same bound holds for the finite join of the
four values, hence
[
d(t)leTpi(d(t)vee d(u)vee d(v))((u,v)in G_t).
@@ -673,18 +673,18 @@ The set Y was fixed before (u,v) varied, and the reductions in
The irrational tin(0,1) was arbitrary; by Lemma~lem:cuts(c) the
degrees d(t) for such t are exactly the noncomputable degrees, and
-pi^{-1}(mathbf 0)=bf0)=mathbf 0.bf0. Therefore
+pi^{-1}(0)=0)=0.0. Therefore
-pi^{-1}(mathbf a)bfa)leTmathbf abfa (mathbf abfainDT)
+pi^{-1}(a)a)leTbfa (ainDT)
for every order automorphism pi.
Now apply (eq:one-sided) to the automorphism pi^{-1}, which is
also an order automorphism and also admits a representing function by
Theorem~thm:representation. This gives
-pi(mathbf a)bfa)leTmathbf abfa for all mathbf a.bfa. Together with
+pi(a)a)leTbfa for all a.a. Together with
(eq:one-sided) and antisymmetry of leT, we get
-pi(mathbf a)=bfa)=mathbf abfa for every degree mathbf a.bfa.
+pi(a)=a)=a for every degree a.a.
The second application uses Theorem~thm:representation for the
@@ -706,17 +706,17 @@ Theorem~thm:rigidity.
% =====================================================================
{99}
- M.~J. Groszek and T.~A. Slaman, A basis theorem for perfect sets, Bull. Symbolic Logic 4 (1998), no.~2, 204--209; author's version (2000) at https://math.berkeley.edu/~slaman/papers/prikry.pdf, whose numbering is used here.
+ M.~J. Groszek and T.~A. Slaman, A basis theorem for perfect sets, Bull. Symbolic Logic 4 (1998), no.~2, 204--209; author's version (2000) at ./pdf/m-j-groszek-and-t-a-1998-no-2-204-209-author-s-version.pdf, whose numbering is used here.
C.~G. Jockusch, Jr. and R.~M. Solovay, Fixed points of jump preserving automorphisms of degrees, Israel J. Math. 26 (1977), no.~1, 91--94.
B. Kjos-Hanssen, Permutations of the integers induce only the trivial automorphism of the Turing degrees, Bull. Symbolic Logic 24 (2018), no.~2, 165--174; arXiv:1603.00525, whose numbering is used here.
A. Kumar and S. Shelah, Large Turing independent sets, Proc. Amer. Math. Soc. 151 (2023), no.~1, 355--367.
P. Lutz and B. Siskind, Part 1 of Martin's conjecture for order-preserving and measure-preserving functions, J. Amer. Math. Soc. 38 (2025), no.~2, 319--367; arXiv:2305.19646, whose numbering is used here.
- D. Marker, Descriptive Set Theory, course notes, Fall 2002, https://www.math.uic.edu/~marker/math512/dst.pdf.
+ D. Marker, Descriptive Set Theory, course notes, Fall 2002, ./pdf/d-marker-descriptive-set-theory-course-2002.pdf.
A. Nerode and R.~A. Shore, Reducibility orderings: theories, definability and automorphisms, Ann. Math. Logic 18 (1980), no.~1, 61--89.
R.~A. Shore, Direct and local definitions of the Turing jump, J. Math. Logic 7 (2007), no.~2, 229--262.
- R.~A. Shore and T.~A. Slaman, Defining the Turing jump, Math. Res. Lett. 6 (1999), no.~5--6, 711--722; author's version at https://math.berkeley.edu/~slaman/papers/jump.pdf.
- T.~A. Slaman, Global properties of the Turing degrees and the Turing jump, in Computational Prospects of Infinity, Part I, Lect. Notes Ser. Inst. Math. Sci. Natl. Univ. Singap. 14, World Scientific, 2008, 83--101; author's version at https://math.berkeley.edu/~slaman/papers/IMS_slaman.pdf, whose numbering is used here.
- T.~A. Slaman and W.~H. Woodin, Definability in Degree Structures, unpublished manuscript, 21 July 2005, https://math.berkeley.edu/~slaman/talks/sw.pdf.
+ R.~A. Shore and T.~A. Slaman, Defining the Turing jump, Math. Res. Lett. 6 (1999), no.~5--6, 711--722; author's version at ./pdf/r-a-shore-and-t-a-1999-no-5-6-711-722-author-s.pdf.
+ T.~A. Slaman, Global properties of the Turing degrees and the Turing jump, in Computational Prospects of Infinity, Part I, Lect. Notes Ser. Inst. Math. Sci. Natl. Univ. Singap. 14, World Scientific, 2008, 83--101; author's version at ./pdf/t-a-slaman-global-properties-of-2008-83-101-author-s-version-at.pdf, whose numbering is used here.
+ T.~A. Slaman and W.~H. Woodin, Definability in Degree Structures, unpublished manuscript, 21 July 2005, ./pdf/t-a-slaman-and-w-h-2005.pdf.
R.~I. Soare, Recursively Enumerable Sets and Degrees, Perspectives in Mathematical Logic, Springer, 1987.
A.~M. Turing, Systems of logic based on ordinals, Proc. London Math. Soc. (2) 45 (1939), 161--228.