pith. sign in

arxiv: 2606.24634 · v1 · pith:MT5JD2M2new · submitted 2026-06-23 · 🧮 math.LO

A radical answer to a question by Robinson

Blaise Boissonneau , Mikel E. Garciarena , Immanuel Halupczok This is my paper

Pith reviewed 2026-06-25 22:19 UTC · model grok-4.3

classification 🧮 math.LO
keywords Puiseux polynomialsdefinabilitylanguage of ringsvaluationordered ringsmodel theoryRobinson question
0
0 comments X

The pith

The leading coefficient order is definable without parameters in the ring of integer Puiseux polynomials.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper shows that the ring of Puiseux polynomials with integer coefficients admits a parameter-free definition, in the language of rings alone, of the order induced by the leading coefficient. A sympathetic reader would care because this settles whether a natural valuation on these generalized polynomials is already expressible using only addition and multiplication. If the claim holds, then first-order properties of the ring capture the ordering without needing an external symbol for the valuation. The result directly answers a question posed by Robinson on definability in this structure.

Core claim

We study the ring of Puiseux polynomials with integer coefficients. We prove notably that the order given by the leading coefficient is definable without parameters in the language of rings. This answers a question of R. Robinson.

What carries the argument

The ring of Puiseux polynomials with integer coefficients, carrying the standard valuation that extracts the exponent of the lowest term, whose order is shown to be definable by a formula in the language of rings.

If this is right

  • The valuation becomes a first-order property internal to the ring language.
  • Model-theoretic study of the ring can proceed without adjoining an order symbol.
  • The positive answer settles Robinson's question for this specific ring.
  • Any first-order sentence true in the ring automatically respects the valuation order.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • Similar definability might be checked in the larger ring of Puiseux series over the integers.
  • The result suggests examining whether other natural valuations on generalized polynomial rings are likewise definable.
  • One could test whether the same ring language suffices for definability questions in nearby structures such as Laurent polynomials.

Load-bearing premise

The structure is exactly the ring of Puiseux polynomials with integer coefficients and the order is the standard valuation from the lowest exponent.

What would settle it

An explicit automorphism of the ring that preserves all ring operations but moves some element relative to the leading-coefficient order would show that no such parameter-free definition exists.

Figures

Figures reproduced from arXiv: 2606.24634 by Blaise Boissonneau, Immanuel Halupczok, Mikel E. Garciarena.

Figure 1
Figure 1. Figure 1: 1 arXiv:2606.24634v1 [math.LO] 23 Jun 2026 [PITH_FULL_IMAGE:figures/full_fig_p001_1.png] view at source ↗
read the original abstract

We study the ring of Puiseux polynomials with integer coefficients. We prove notably that the order given by the leading coefficient is definable without parameters in the language of rings. This answers a question of R. Robinson.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 1 minor

Summary. The manuscript studies the ring of Puiseux polynomials with integer coefficients. It proves that the order given by the leading coefficient (the lowest-term valuation) is definable without parameters in the language of rings. This answers a question of R. Robinson.

Significance. If the result holds, the paper supplies a parameter-free definability result for the standard valuation inside this specific ring, directly resolving Robinson's question on definability. The contribution lies in exhibiting an explicit construction internal to the ring language that isolates the valuation.

minor comments (1)
  1. The abstract is terse; a brief outline of the key definability formula or the main lemma in the introduction would improve accessibility without altering the technical content.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive report and the recommendation to accept the manuscript.

Circularity Check

0 steps flagged

No significant circularity

full rationale

The paper asserts a parameter-free definability result for the lowest-term valuation inside the ring of Puiseux polynomials over Z. The abstract and reader's summary contain no equations, no fitted parameters, no self-citations used as load-bearing premises, and no reduction of a claimed prediction to its own inputs by construction. The central claim is a pure existence statement in model theory whose verification would require an explicit formula or proof, none of which reduce to the inputs by the patterns enumerated. This is the normal case of a self-contained mathematical existence proof.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The work is a pure existence proof in model theory. It relies on the standard axioms of first-order logic and commutative ring theory; no numerical parameters are fitted and no new entities are postulated.

axioms (2)
  • standard math The language of rings consists of addition, multiplication, and constants 0 and 1.
    Invoked implicitly when the paper speaks of definability 'in the language of rings'.
  • domain assumption Puiseux polynomials with integer coefficients form a commutative ring under termwise addition and the usual Cauchy product.
    This is the ambient structure whose definable sets are under study.

pith-pipeline@v0.9.1-grok · 5551 in / 1264 out tokens · 14575 ms · 2026-06-25T22:19:00.578428+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

5 extracted references

  1. [1]

    Theoremata arithmetica nova methodo demonstrata

    Leonhard Euler. Theoremata arithmetica nova methodo demonstrata. Novi Commentarii academiae scientiarum Petropolitanae , 8:74--104, 1763

  2. [2]

    Kleen, and J

    Kurt Gödel, Stephen C. Kleen, and J. B. Rosser. On undecidable propositions of formal mathematical systems. In Notes on lectures by Kurt Gödel . 1934

    1934

  3. [3]

    Démonstration d'un théorème d'arithmétique

    Joseph Louis de Lagrange. Démonstration d'un théorème d'arithmétique. In Nouveaux mémoires de L'Académie Royale des Sciences et Belles-Lettres de Berlin , 1770

  4. [4]

    Robinson

    Raphael M. Robinson. Undecidable rings. Transactions of the American Mathematical Society , 70(1):137--159, 1951

    1951

  5. [5]

    Robinson

    Alfred Tarski, Andrzej Mostowski, and Raphael M. Robinson. Undecidable Theories . Studies in Logic and the Foundations of Mathematics. North-Holland Publishing Company, Amsterdam, 1953

    1953