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 Counterexample to Kurosh’s Division-Ring Problem

There is a countable division ring DD of characteristic zero, with center F=Z(D)F = Z(D), and elements x,y∈Dx, y \in D such that D=F[x,y]=F(x,y)D = F[x, y] = F(x, y) and [D:F]=∞[D : F] = \infty, while every element of DD is algebraic over FF, giving a negative answer to the Kurosh problem for division rings.

Given a countable field kk of characteristic zero containing every root of unity, a finite-dimensional central division algebra A/kA/k, and X∈A⟨⟨z1,z2⟩⟩uX \in A\langle\langle z_1, z_2\rangle\rangle^u whose constant tuple X0X_0 generates AA as a kk-algebra and whose linear coefficients X1,X2X_1, X_2 have linearly independent classes in Au/JA(X0)A^u / J_A(X_0), for every w∈A⟨⟨z1,z2⟩⟩w \in A\langle\langle z_1, z_2\rangle\rangle there exist a countable field extension k′/kk'/k, a central division algebra A′/k′A'/k' of strictly larger degree, and series X′∈A′⟨⟨s1,s2⟩⟩uX' \in A'\langle\langle s_1, s_2\rangle\rangle^u and w′∈A′⟨⟨s1,s2⟩⟩w' \in A'\langle\langle s_1, s_2\rangle\rangle preserving all noncommutative polynomial identities over kk, restoring generation and linear independence of X1′,X2′X'_1, X'_2 modulo JA′(X0′)J_{A'}(X'_0), and satisfying q(w′)=0q(w') = 0 for some monic nonzero q∈k′[t]q \in k'[t].

For the generic direction vv chosen in (5.3), there is a partition of {1,…,en}\{1, \dots, e_n\} such that the active response space is TP={c∈ΩPen:ch/Dh(P;v) is constant on each part}\mathcal{T}_P = \{c \in \Omega_P^{e_n} : c_h / D_h(P; v) \text{ is constant on each part}\}.

If every fixed-root Schur expression Sh(Z)S_h(Z) vanishes in degrees less than ℓ≥1\ell \ge 1, then for each word ω\omega of length ℓ\ell, [Sh(Z)]ω=ch,ωπh[S_h(Z)]_\omega = c_{h,\omega} \pi_h for scalars ch,ω∈Ec_{h,\omega} \in E with (ch,ω)h∈I∈(TP∣I)⊗E(c_{h,\omega})_{h \in I} \in (\mathcal{T}_P|_I) \otimes E; the same holds for homogeneous degree-ℓ\ell coefficients of perturbations in finitely many commuting parameters.

For any finite nonempty collection of independent generic size-bb points PiP_i, there is a gg-dimensional space G{Pi}⊆⨁iHPi∗\mathcal{G}_{\{P_i\}} \subseteq \bigoplus_i H_{P_i}^* whose projection to each HPi∗H_{P_i}^* is an isomorphism, which annihilates all joint paired responses, and which restricts compatibly when independent blocks are adjoined.

Under the hypotheses of Theorem 9.1, if the fixed-root Schur expressions Si,hS_{i,h} vanish in every degree below ℓ≥1\ell \ge 1, then for every cyclic orbit O\mathcal{O} of words of length ℓ\ell and every c∈Gc \in \mathcal{G}, the cyclic sum ∑ω∈O∑i=1m∑h∈Iici,hei,h,ω=0\sum_{\omega \in \mathcal{O}} \sum_{i=1}^m \sum_{h \in I_i} c_{i,h} e_{i,h,\omega} = 0.

Over the eleven-block pattern in Z/11Z\mathbb{Z}/11\mathbb{Z} with forward offsets 1,21, 2 for s1s_1 and 3,43, 4 for s2s_2, there is a pair Z(s1,s2)∈Mmb(E)⟨⟨s1,s2⟩⟩2Z(s_1, s_2) \in M_{mb}(E)\langle\langle s_1, s_2\rangle\rangle^2 with constant term RR and the prescribed generic linear coefficients for which Si,h(Z)=0S_{i,h}(Z) = 0 for every i,hi, h, constructible by finite linear systems.

Methods

Inductively schedule all noncommutative polynomials over countable fields kik_i and form an ultraproduct D=∏i≥0Ai/U\mathcal{D} = \prod_{i \ge 0} A_i / \mathcal{U} to obtain a countable two-generated algebraic division ring R=k∞[x,y]R = k_\infty[x, y].

Source excerpts

“Enumerate the pairs (i, j) ∈ N2 by increasing i + j, in a fixed order within each diagonal. If (in, jn) is the nth pair, beginning at n = 0, then in ≤ n. At stage n, apply the lifting theorem to w = pin,jn(X(n)).” · Show in paper

“Fix a nonprincipal ultrafilter U on N and form (see [10] for the general construction) D = ∏i≥0 Ai / U.” · Show in paper

Use finite descent of the multiplication table and generator coordinates over F=Z(R)F = Z(R) to deduce [R:F]=∞[R : F] = \infty from [R:k∞]=∞[R : k_\infty] = \infty.

Source excerpts

“We use finite descent of the multiplication table and generator coordinates; compare the proof of the local-finiteness criterion in [3, Section 4].” · Show in paper

Evaluate free formal series at small generic matrix points over complete discretely valued fields E=C((ε))E = C((\varepsilon)) and detect formal identities by independent residues.

Source excerpts

“Let E be a complete discretely valued field containing K, with valuation v, such that v(c) = 0 for c ∈ K×. We use E = C((ε)), or a finite extension of such a field, and normalize v(ε) = 1.” · Show in paper

Use the fixed-root Schur expression Sh(W)=π(W−λh)π−πWπˉCh(W)−1πˉWπS_h(\mathcal{W}) = \pi(\mathcal{W} - \lambda_h)\pi - \pi\mathcal{W}\bar{\pi}C_h(\mathcal{W})^{-1}\bar{\pi}\mathcal{W}\pi to convert the polynomial identity q(W(Z))=0q(W(Z)) = 0 into order-by-order linearizable equations.

Source excerpts

“Define the fixed-root Schur expression by Sh(W) = π(W − λh)π − πWπ¯Ch(W)−1π¯Wπ. (5.1)” · Show in paper

Unfold a free word along a triangular chain of ℓ+1\ell + 1 states and regularize the internal partner by P↦P+ξvP \mapsto P + \xi v to transfer leading free-word coefficients into the active response space.

Source excerpts

“Unfolding the word. Use ℓ + 1 ordered states. On consecutive steps put the letters of ω, and evaluate a word by following that path.” · Show in paper

Repeat each block LL times and attach LL individual hubs and one common hub ∗* to test the left nullspace of limiting derivative columns, then test on directed-cycle matrices to isolate cyclic orbits.

Source excerpts

“Adjoin L + 1 independent generic size-b hub blocks, indexed by p = 1, . . . , L and by ∗, with spectra disjoint from the old blocks.” · Show in paper

Use an eleven-block pattern in Z/11Z\mathbb{Z}/11\mathbb{Z} with forward offsets 1,21, 2 for s1s_1 and 3,43, 4 for s2s_2 to solve the Schur equations order-by-order via finite linear systems.

Source excerpts

“Put m = 11 and index the blocks by i ∈ Z/mZ.” · Show in paper

Realize the split matrix blocks and arrows in a central division algebra D/FD/F using symbol algebras BbB_b and cyclic algebras CC, and descend finite affine linear correction systems to FF.

Source excerpts

“Define B˜0 = (Bb ⊗k0 F0) ⊗F0 C, D0 = A ⊗k B˜0.” · Show in paper

Apply a Taylor translation Y′(s1′,s2′)=Y(γ+s1′,s2′)Y'(s'_1, s'_2) = Y(\gamma + s'_1, s'_2) with a central Laurent parameter γ\gamma and restrict to a countable subfield k′k' to restore generation and two transverse directions.

Source excerpts

“For a new central Laurent parameter γ, define Y′(s′1, s′2) = Y(γ + s′1, s′2).” · Show in paper