By OpenAISourceGitHub

Manuscripts from openai/math

Fork
Clone
git clone https://openversions.com/git/index/openai-math.git
Cite
Version link
https://openversions.com/index/openai-math/commit/dfd8c46870b48511e697cbb43a3c8c91d375fa2f
Version identifier (commit hash)
dfd8c46870b48511e697cbb43a3c8c91d375fa2f

Fork to create your own copy with credit to the source. Clone to get a Git copy on your computer.

All papers

Claims

Findings

A CH obstruction to a prescribed categoricity threshold

Assuming the continuum hypothesis, there is an abstract elementary class KK in a countable finitary relational language such that LS(K)=ℵ0\mathrm{LS}(K) = \aleph_0, KK has at least two nonisomorphic models of cardinality ℶω2=H(K)\beth_{\omega_2} = H(K), and putting Λ=ℶ(2ℵ1)+\Lambda = \beth_{(2^{\aleph_1})^+}, the class KK is categorical in every cardinal μ≥Λ\mu \ge \Lambda; in particular, λ=Λ+>H(K)\lambda = \Lambda^+ > H(K) is a categoricity cardinal from which downward transfer to H(K)H(K) fails.

The pair K=(C,≤K)K = (\mathcal{C}, \le_K) of Definition 3.7 is an abstract elementary class in a fixed countable finitary relational language, with LS(K)=ℵ0\mathrm{LS}(K) = \aleph_0, and has the union and common-upper-bound properties for every nonempty set-indexed directed family of strong substructures.

Assuming CH, the class KK has two nonisomorphic models of cardinality ℶη\beth_\eta (η=ω2\eta = \omega_2): one has an order sort of cardinality ℵ1\aleph_1, and the other has a countable order sort.

Assuming CH, the class KK is categorical in every cardinal μ≥Λ\mu \ge \Lambda, where Λ=ℶ(2ℵ1)+\Lambda = \beth_{(2^{\aleph_1})^+}.

If M∈KM \in K and BMB^M is uncountable, then ∣IM∣<Λ|I^M| < \Lambda.

If M,N∈KM, N \in K have countable base orders and ∣IM∣=∣IN∣|I^M| = |I^N|, then M≅NM \cong N.

ZFC proves CH⇒Θ\mathrm{CH} \Rightarrow \Theta. For each fixed first-order formulation Φ\Phi of the universal assertion (1.2) whose fixed-family instance is provable from Φ\Phi in ZFC, ZFC also proves CH⇒¬Φ\mathrm{CH} \Rightarrow \neg\Phi, and Con(ZFC)⇒Con(ZFC+Θ)⇒Con(ZFC+¬Φ)\mathrm{Con}(\mathrm{ZFC}) \Rightarrow \mathrm{Con}(\mathrm{ZFC}+\Theta) \Rightarrow \mathrm{Con}(\mathrm{ZFC}+\neg\Phi). If ZFC is consistent, no such Φ\Phi is a theorem of ZFC.

The class KK has neither joint embedding nor amalgamation, and the failure of amalgamation can be witnessed over a countable model.

Assuming CH, if H∈KH \in K has countable base, its canonical point pHp_H does not factor through Sh(C0op,J¬¬)\mathrm{Sh}(\mathcal{C}_0^{\mathrm{op}}, J_{\neg\neg}); this applies, in particular, to every model on the categoricity tail ∥H∥≥Λ\|H\| \ge \Lambda.

Methods

Torsor and finite-support bit-matrix construction: structures have an index sort I, a locally countable dense linear order B without endpoints, finite-support groups G(B) \cong [B]^{<\omega} and G_* \cong [\omega]^{<\omega}, and row/column torsors with a bit relation e(z+u, w+v) = e(z,w) + 1_{b \in \mathrm{supp}(u)} + 1_{n \in v} \pmod 2 encoding colors in S = 2^\omega / =^*.

Source excerpts

“Definition 3.2 (Basic structures). A basic structure has the following data, with pairwise disjoint underlying carriers. (a) A nonempty set I, and a nonempty dense linear order B without endpoints in which every bounded interval is countable. (b) A group sort G(B) coding [B]^{<\omega} under symmetric difference... (c) For each t \in T(I) and n < \omega, a nonempty set Zt,nZ_{t,n} with a free transitive action of G(B). For each t \in T(I) and b \in B, a nonempty set Wt,bW_{t,b} with a free transitive action of G_*. (d) A binary relation on row and column points, written as its indicator e(z, w) \in \{0, 1\}.” · Show in paper

Full subsequence diagram tests: encoding countable extensional relations with ordinal tags below \omega_1 into S = 2^\omega / =^* via coding maps \iota_k : \mathfrak{D}_k \to S, and requiring tuples and all their nonempty subsequences to pass the full subsequence test T_k outside a tuple-dependent countable set of base coordinates.

Source excerpts

“Definition 2.3 (The full subsequence test). Given k \ge 1 and colors (s_J : \emptyset \ne J \subseteq [k]), let T_k((s_J)_J) mean that both of the following conditions hold. (i) For every nonempty J \subseteq [k], the color s_J decodes under \iota_{|J|} to a valid diagram D_J. (ii) For every nonempty J \subseteq [k], D_J = D[k]D_{[k]} \upharpoonright J.” · Show in paper

Local rank approximation modulo countable sets: constructing an \omega_2-long sequence of functions f_\alpha : \delta \to \delta increasing modulo countable sets to represent actual membership ranks in Vω2V_{\omega_2} by tags below \omega_1 outside a countable set of coordinates.

Source excerpts

“Lemma 4.1. There are functions f_\alpha : \delta \to \delta, for \alpha < \eta, such that for all \gamma < \alpha < \eta the set Eγ,αE_{\gamma,\alpha} = \{\beta < \delta : f_\gamma(\beta) \ge f_\alpha(\beta)\} is countable.” · Show in paper

End-homogeneous finite partition calculus and tagged Mostowski collapse: using an end-homogeneous finite partition estimate and unbounded-sample selection to extract a fixed-arity color pattern in SBMS^{B^M} when |I^M| \ge \Lambda and B^M is uncountable, contradicting the ordinal-tagged Mostowski collapse bound into V_\delta.

Source excerpts

“The finite-arity proof uses the end-homogeneous method of classical partition calculus [3]. We give the particular estimate and the subsequent selection of fixed colors explicitly, so their cardinal bounds and quantifiers are part of the argument.” · Show in paper

“Lemma 5.1 (Collapse of the tagged relation). Let Q be a set with an extensional binary relation R and a function \rho : Q \to \delta such that yRx \implies \rho(y) < \rho(x). Then there is an injection F : Q \to V_\delta satisfying F(x) = \{F(y) : yRx\}.” · Show in paper

Difference-matrix absorption for countable-base isomorphisms: enumerating countable base orders and using finite row translations (k \le n) and finite column translations (n < k) to eliminate any \omega-by-\omega difference matrix d(n,k) and construct an isomorphism between any two models in K with countable base orders and equally sized index sorts.

Source excerpts

“Each row uses only the finitely many positions k \le n, and each column only the finitely many positions n < k; within these positions one shifts exactly where the difference bit is one. Thus finite row and column translations remove every difference matrix.” · Show in paper