Classification Theory and the Construction of PAC Fields

Nicholas Ramsey

PAC fields inherit order properties from coded graphs, making the SOP_n hierarchy strict in the class of fields.

Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

T0 review · grok-4.3

2026-06-29 09:35 UTC pith:YEX6SR76

load-bearing objection Ramsey shows the SOP_n hierarchy stays strict for fields by proving preservation of graph properties under a refined Cherlin-van den Dries-Macintyre coding into PAC fields.

arxiv 2605.28299 v1 pith:YEX6SR76 submitted 2026-05-27 math.LO

Classification Theory and the Construction of PAC Fields

Nicholas Ramsey This is my paper

classification math.LO

keywords PAC fieldsSOP_n hierarchyabsolute Galois groupsprofinite groupsinverse systemsmodel theory of fieldsclassification theory

verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

The pith

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

The paper examines a construction that encodes graphs into PAC fields by realizing inverse systems of profinite groups as their absolute Galois groups. It shows that model-theoretic properties of the graph, such as the n-strong order property, are preserved in the resulting field in many cases. This preservation produces fields that realize each level of the SOP_n hierarchy without higher levels. A sympathetic reader would care because the result separates classification-theoretic dividing lines inside the concrete class of fields rather than leaving them abstract.

Core claim

By analyzing the model theory of inverse systems of profinite groups that code graphs and serve as absolute Galois groups of PAC fields, the construction preserves graph properties in the field; as a corollary the SOP_n hierarchy is strict in the class of fields.

What carries the argument

The detailed treatment of the model theory of inverse systems of certain profinite groups that code graphs and can be realized as the absolute Galois groups of PAC fields.

Load-bearing premise

Model-theoretic properties of the graph are preserved when the graph is coded into the PAC field through the inverse system of profinite groups.

What would settle it

Produce a graph with SOP_n but not SOP_{n+1} such that the associated PAC field fails to satisfy SOP_n.

Watch this falsifier — get emailed when new claim-graph text bears on it.

If this is right

For each n there exists a field with SOP_n but not SOP_{n+1}.
Many model-theoretic properties of graphs transfer to the corresponding PAC fields.
Classification theory distinctions between fields can be realized by explicit algebraic constructions.

Where Pith is reading between the lines

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

The same transfer technique might apply to other dividing lines or instability properties in model theory.
Similar codings could separate classification properties inside other algebraic classes such as rings or groups.
The Galois-theoretic coding may connect to questions about which abstract model-theoretic configurations arise in number-theoretic fields.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Desk Editor's Note

Ramsey shows the SOP_n hierarchy stays strict for fields by proving preservation of graph properties under a refined Cherlin-van den Dries-Macintyre coding into PAC fields.

read the letter

The main thing to know is that this paper turns an existing construction into a way to keep SOP_n properties intact when moving from graphs to certain PAC fields, which immediately yields the corollary that the hierarchy is strict inside the class of fields.

Ramsey focuses on inverse systems of profinite groups that code the graphs and can serve as absolute Galois groups. The detailed model-theoretic treatment of those systems is the actual new work, and it establishes preservation in many cases. That step is what lets the corollary go through cleanly.

The argument looks technically solid. It builds directly on the prior construction without circularity, and the stress-test found no internal gaps or unstated assumptions that would break the preservation claim. The fact that preservation is stated only for many cases rather than all is a strength, not a weakness, because it keeps the claims proportionate.

One soft spot is that the full verification of the group-theoretic details still needs expert checking, but nothing in the abstract or the described approach suggests a load-bearing flaw. The reliance on the older construction is fine since the extension is independent.

This is for model theorists who work on classification in fields or on SOP-type properties in algebraic settings. A reader already following PAC fields or Galois-theoretic model theory would get concrete value from the preservation results.

I would send it to peer review. The corollary organizes existing phenomena at a useful level and the technical core on inverse systems is new enough to warrant referee time.

Referee Report

0 major / 2 minor

Summary. The paper analyzes the Cherlin-van den Dries-Macintyre construction for coding graphs into PAC fields. It shows that model-theoretic properties of the graph are preserved in the passage from the graph to the field in many cases. The main ingredient is a detailed treatment of the model theory of inverse systems of certain profinite groups that code graphs and can be realized as the absolute Galois groups of PAC fields. As a corollary, the SOP_n hierarchy is shown to be strict in the class of fields.

Significance. If the preservation results hold, the work provides a systematic method for transferring combinatorial model-theoretic properties from graphs to PAC fields via Galois-theoretic constructions. This is significant for classification theory, as the corollary establishes the strictness of the SOP_n hierarchy within fields, separating levels of instability in a concrete algebraic class. The detailed analysis of inverse systems of profinite groups is a technical strength that may apply more broadly.

minor comments (2)

Abstract: the phrase 'in many cases' for preservation could be made more precise by indicating the conditions on the graphs or groups under which preservation holds.
The introduction should include a brief comparison with other known constructions of fields with prescribed SOP_n properties to clarify the novelty of the corollary.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive assessment of the paper and the recommendation to accept. The report accurately summarizes the main results on coding graphs into PAC fields and the strictness of the SOP_n hierarchy in fields. There are no major comments requiring a point-by-point response.

Circularity Check

0 steps flagged

No significant circularity detected

full rationale

The paper extends an external construction due to Cherlin-van den Dries-Macintyre by supplying a model-theoretic analysis of inverse systems of profinite groups realized as absolute Galois groups of PAC fields. Preservation of graph properties (including SOP_n) is shown directly from this analysis and yields the strictness corollary; the argument does not reduce any claimed result to a self-citation, a fitted parameter renamed as a prediction, or a definitional equivalence. The cited prior work is by distinct authors and supplies an independent base rather than a load-bearing self-reference.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The work rests on the prior Cherlin-van den Dries-Macintyre construction for coding graphs and on standard model theory of profinite groups and PAC fields; no free parameters or invented entities are evident from the abstract.

axioms (2)

domain assumption The Cherlin-van den Dries-Macintyre construction codes graphs in PAC fields.
Invoked as the base for the analysis in the abstract.
domain assumption Inverse systems of certain profinite groups can be realized as absolute Galois groups of PAC fields.
Central to the main ingredient described in the abstract.

pith-pipeline@v0.9.1-grok · 5597 in / 1154 out tokens · 22889 ms · 2026-06-29T09:35:39.880277+00:00 · methodology

0 comments

read the original abstract

We analyze a construction of Cherlin, van den Dries, and Macintyre to code graphs in PAC fields. We show that, in many cases, model-theoretic properties of the graph are preserved in the passage from the graph to the field. As a corollary, we show that the SOP$_{n}$ hierarchy is strict in the class of fields. The main ingredient is a detailed treatment of the model theory of inverse systems of certain profinite groups that code graphs and can be realized as the absolute Galois groups of PAC fields.

discussion (0)

Reference graph

Works this paper leans on

4 extracted references · 3 canonical work pages

[1]

Mekler’s construction and tree properties.arXiv preprint arXiv:1903.07087,

[Ahn19] JinHoo Ahn. Mekler’s construction and tree properties.arXiv preprint arXiv:1903.07087,

work page arXiv 1903
[2]

Mekler’s construction and murphy’s law for 2-nilpotent groups.arXiv preprint arXiv:2403.20270,

[BPT24] Blaise Boissonneau, Aris Papadopoulos, and Pierre Touchard. Mekler’s construction and murphy’s law for 2-nilpotent groups.arXiv preprint arXiv:2403.20270,

work page arXiv
[3]

Simplicity and independence for pseudo-algebraically closed fields

[Cha99] Zo´ e Chatzidakis. Simplicity and independence for pseudo-algebraically closed fields. InModels and computability (Leeds, 1997), volume 259 ofLondon Math. Soc. Lecture Note Ser., pages 41–61. Cambridge Univ. Press, Cambridge,

1997
[4]

Interpolative fusions ii: Preservation results.arXiv preprint arXiv:2201.03534,

[KTW22] Alex Kruckman, Minh Chieu Tran, and Erik Walsberg. Interpolative fusions ii: Preservation results.arXiv preprint arXiv:2201.03534,

work page arXiv

[1] [1]

Mekler’s construction and tree properties.arXiv preprint arXiv:1903.07087,

[Ahn19] JinHoo Ahn. Mekler’s construction and tree properties.arXiv preprint arXiv:1903.07087,

work page arXiv 1903

[2] [2]

Mekler’s construction and murphy’s law for 2-nilpotent groups.arXiv preprint arXiv:2403.20270,

[BPT24] Blaise Boissonneau, Aris Papadopoulos, and Pierre Touchard. Mekler’s construction and murphy’s law for 2-nilpotent groups.arXiv preprint arXiv:2403.20270,

work page arXiv

[3] [3]

Simplicity and independence for pseudo-algebraically closed fields

[Cha99] Zo´ e Chatzidakis. Simplicity and independence for pseudo-algebraically closed fields. InModels and computability (Leeds, 1997), volume 259 ofLondon Math. Soc. Lecture Note Ser., pages 41–61. Cambridge Univ. Press, Cambridge,

1997

[4] [4]

Interpolative fusions ii: Preservation results.arXiv preprint arXiv:2201.03534,

[KTW22] Alex Kruckman, Minh Chieu Tran, and Erik Walsberg. Interpolative fusions ii: Preservation results.arXiv preprint arXiv:2201.03534,

work page arXiv