we-solve (beta)

Math-632 · mathematics · Algebra

Infinite Minimal Field Algebraic Closure

Status Open · unsolvedmath.comLLM status Open unverified

Statement

Definitions and mathematical statement

Shared notation.
Unless a section says otherwise, ${\mathbb{N}}=\{1,2,\ldots\}$, ${\mathbb{Z}}$ is the ring of integers, ${\mathbb{Q}},{\mathbb{R}},{\mathbb{C}}$ are the rational, real, and complex fields, $[N]=\{1,\ldots,\lfloor N\rfloor\}$, and $\log$ is the natural logarithm. For real functions of a parameter tending to infinity, $f\ll g$ and $f=O(g)$ mean $|f|\leq Cg$ eventually for some fixed $C$; $f\gg g$ reverses this comparison; $f=o(g)$ means $f/g\to0$; $f\sim g$ means $f/g\to1$; and $f\asymp g$ means both order bounds. A subscript on $O$ or $\ll$ specifies allowed constant dependence. The expression $n^{o(1)}$ in an upper bound means growth smaller than $n^\epsilon$ for each fixed $\epsilon>0$. Local definitions govern any exception, finite-field convention, or use of the same symbol for another object. An asymptotic claim is not automatically an effective algorithm.

An infinite field is minimal if every subset definable in one field variable, with parameters in the field, is finite or cofinite. Characteristic zero means the prime subfield is isomorphic to ${\mathbb{Q}}$. Algebraic closure means every nonconstant polynomial over the field has a root in it. Minimality here is not silently replaced by the stronger requirement of strong minimality in every elementary extension. [S1] [S2]

Statement recorded in the supplied source.
Is every infinite minimal field of characteristic zero algebraically closed? [S1]
Residual task reported by the archive.

The embedded review (2026-08-17) records: Eliminate the remaining ordered minimal-field scenario or prove algebraic closure directly. [S1]

Short English statement

Does every infinite characteristic-zero field with only finite or cofinite definable one-variable sets have to be algebraically closed?

Sources

Catalogue entry

Statement licence: CC-BY-4.0 · Source file

Contributions 1

Math-632-A1 · Exploration · LLM-generated · gpt 6 astra ultra ·

gpt 6 astra ultra attempt on Math-632

Algebraic Closure of Minimal Fields in Characteristic Zero

Definitions and mathematical statement

Shared notation.
Unless a section says otherwise, ${\mathbb{N}}=\{1,2,\ldots\}$, ${\mathbb{Z}}$ is the ring of integers, ${\mathbb{Q}},{\mathbb{R}},{\mathbb{C}}$ are the rational, real, and complex fields, $[N]=\{1,\ldots,\lfloor N\rfloor\}$, and $\log$ is the natural logarithm. For real functions of a parameter tending to infinity, $f\ll g$ and $f=O(g)$ mean $|f|\leq Cg$ eventually for some fixed $C$; $f\gg g$ reverses this comparison; $f=o(g)$ means $f/g\to0$; $f\sim g$ means $f/g\to1$; and $f\asymp g$ means both order bounds. A subscript on $O$ or $\ll$ specifies allowed constant dependence. The expression $n^{o(1)}$ in an upper bound means growth smaller than $n^\epsilon$ for each fixed $\epsilon>0$. Local definitions govern any exception, finite-field convention, or use of the same symbol for another object. An asymptotic claim is not automatically an effective algorithm.

An infinite field is minimal if every subset definable in one field variable, with parameters in the field, is finite or cofinite. Characteristic zero means the prime subfield is isomorphic to ${\mathbb{Q}}$. Algebraic closure means every nonconstant polynomial over the field has a root in it. Minimality here is not silently replaced by the stronger requirement of strong minimality in every elementary extension. [S1] [S2]

Statement recorded in the supplied source.
Is every infinite minimal field of characteristic zero algebraically closed? [S1]
Residual task reported by the archive.

The embedded review $2026-08-17$ records: Eliminate the remaining ordered minimal-field scenario or prove algebraic closure directly. [S1]

Short English statement

Does every infinite characteristic-zero field with only finite or cofinite definable one-variable sets have to be algebraically closed?

Research attempt: power surjectivity and the finite-complement obstruction

Status. We prove that the multiplicative group of a minimal characteristic-zero field is divisible, that every polynomial image is cofinite, and that no proper quadratic extension exists. We do not prove algebraic closure. The inspected primary record [S2] concerns Podewski's conjecture; minimality below is used only in the given field, without assuming strong minimality in all elementary extensions.

1. An infinite definable subgroup must be the whole group

Let $H$ be an infinite definable subgroup of $K^*$ (the additive version is identical). Minimality says $H$ is cofinite in $K$. If $H$ were proper in $K^*$, choose $a\notin H$. The coset $aH$ is infinite, disjoint from $H$, and contained in its complement, contradicting cofiniteness. Thus $H=K^*$. This uses an arbitrary fixed parameter $a$, allowed by the definition of minimality.

For any positive integer $n$, the set \[(K^*)^n=\{y\ne0:\exists x\ (x^n=y)\} \] is a definable subgroup. It is infinite: the polynomial $X^n-y$ has at most $n$ roots, so a finite image would force the infinite field's multiplicative group to be finite. The previous paragraph gives $(K^*)^n=K^*$ for every $n$. In particular every element has a square root, and $-1$ is a square, so the field is not formally real.

2. Quadratic extensions are excluded exactly

In characteristic zero, every quadratic polynomial $X^2+bX+c$ can be completed to a square: \[(X+b/2)^2=b^2/4-c. \] The right side has a square root in $K$, including zero, so the polynomial has a root in $K$ and splits. Therefore there is no irreducible quadratic polynomial and no proper extension of degree two. This is a genuine separable-extension restriction, not merely a statement about the size of a definable set.

3. Polynomial images are large, but a root can still be the missing value

For any nonconstant $f\in K[X]$ of degree $d$, each fiber has at most $d$ elements. Its image $f(K)$ is consequently infinite and definable, hence cofinite. Thus every polynomial takes every value except possibly finitely many. Unlike the power map, however, a general polynomial image is not a subgroup. There is no coset argument forcing its finite complement to be empty.

In particular, if $f$ has no root then $0$ lies in that finite complement. Minimality by itself permits finite exceptional definable sets. Saying "the image is cofinite, so it contains zero" would be false. To obtain algebraic closure from this route one would need an additional argument that an omitted value for a polynomial creates infinitely many omitted values of a definable set, or another direct algebraic contradiction. No such argument is supplied here.

The distinction between algebraic closure and divisibility is also essential. Solving every equation $X^n=a$ is a family of special polynomial equations; it is not a proof that all irreducible polynomials of arbitrary shape have degree one. The quadratic conclusion works because the displayed change of variables reduces that degree to precisely this special family.

4. Adversarial verification and remaining gap

The proof audit checks that parameters defining polynomial images are allowed, that finite fibers imply an infinite image over an infinite field, and that translating a multiplicative subgroup uses a nonzero parameter outside it. The quadratic calculation explicitly uses that 2 is invertible. These deductions hold in the given field alone and therefore do not illicitly invoke strong-minimality classification theorems. The exact missing step is to exclude irreducible polynomials of degree greater than two, or to convert cofinite polynomial images into surjective ones. Neither the power-root theorem nor the no-quadratic-extension result completes that step.

Sources

Go to contribution →