pith. sign in

arxiv: 2503.02121 · v2 · submitted 2025-03-03 · 🧮 math.LO · math.CO· math.GR

On the model theory of the Farey graph

Zahra Mohammadi Khangheshlaghi , Katrin Tent This is my paper

Pith reviewed 2026-05-23 01:06 UTC · model grok-4.3

classification 🧮 math.LO math.COmath.GR MSC 03C45
keywords Farey graphmodel theoryω-stabilityMorley rankaxiomatizationstable theoriesgraphs
0
0 comments X

The pith

The theory of the Farey graph admits an axiomatization and is ω-stable of Morley rank ω.

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

The paper supplies a set of first-order axioms that define the theory of the Farey graph, the infinite graph whose vertices are the rational numbers and whose edges join fractions a/b and c/d precisely when |ad − bc| = 1. It then establishes that this theory is ω-stable, meaning every type over a countable set has finite multiplicity and the theory is stable in every infinite cardinality. The proof also shows that the Morley rank of the theory equals ω. A reader would care because the Farey graph encodes adjacency relations among rationals that appear throughout number theory and hyperbolic geometry; a model-theoretic classification therefore supplies a uniform language for studying definable subsets and automorphisms of these structures.

Core claim

The authors give a complete axiomatization of the first-order theory of the Farey graph and prove that the resulting theory is ω-stable with Morley rank exactly ω.

What carries the argument

A finite set of first-order axioms that together isolate the theory of the Farey graph, used as the base for computing its stability spectrum and Morley rank.

If this is right

  • Every model of the theory is ω-stable, hence stable in every infinite cardinality.
  • Definable sets in models receive a well-defined finite or ordinal Morley rank at most ω.
  • The theory admits a notion of dimension that behaves like a rank function on definable sets.
  • Automorphism groups of models inherit tameness properties from ω-stability.

Where Pith is reading between the lines

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

  • The same axiomatization may classify elementary extensions or saturated models of the Farey graph that arise in Diophantine approximation.
  • Morley rank ω suggests the theory sits at the boundary between finite-rank and infinite-rank stable theories, inviting comparison with other geometrically defined graphs.
  • One could test whether the axioms remain complete when the graph is expanded by a unary predicate for the integers.

Load-bearing premise

The listed axioms are necessary and sufficient to capture every first-order property true in the Farey graph.

What would settle it

Exhibit a structure that satisfies the axioms yet fails to be elementarily equivalent to the standard Farey graph on the rationals, or compute a formula whose Morley rank exceeds ω inside the theory.

read the original abstract

We axiomatize the theory of the Farey graph and prove that it is $\omega$-stable of Morley rank $\omega$.

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

1 major / 0 minor

Summary. The paper axiomatizes the first-order theory of the Farey graph and proves that the resulting theory is ω-stable of Morley rank ω.

Significance. If the axiomatization is shown to be correct and complete for the Farey graph and the stability argument is verified, the result would supply a concrete new example of an ω-stable theory of a graph, which is of interest in the model theory of relational structures. The paper ships an explicit axiomatization, which is a strength when the axioms can be checked against the graph.

major comments (1)
  1. The provided abstract states the main theorem but contains no explicit list of axioms, no proof sketch, and no verification that the axioms are satisfied by the Farey graph or that they axiomatize its complete theory; without these details the central claim cannot be assessed for soundness.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their report. The major comment concerns the abstract; we clarify below that the full manuscript supplies the requested details.

read point-by-point responses

  1. Referee: The provided abstract states the main theorem but contains no explicit list of axioms, no proof sketch, and no verification that the axioms are satisfied by the Farey graph or that they axiomatize its complete theory; without these details the central claim cannot be assessed for soundness.

    Authors: The abstract is deliberately concise. The manuscript itself contains the explicit list of axioms (Section 2), a proof sketch (Introduction), verification that the axioms hold in the Farey graph (Proposition 3.1 and surrounding discussion), and the argument that the axioms axiomatize the complete theory (Theorem 4.2 and Section 4). These elements in the body permit assessment of the central claim. revision: no

Circularity Check

0 steps flagged

No significant circularity; axiomatization and stability proof are independent

full rationale

The paper states it axiomatizes the theory of the Farey graph and then proves the resulting theory is ω-stable of Morley rank ω. This is a standard model-theoretic workflow: the axioms are offered as a description of the concrete structure, after which first-order properties (including stability) are derived. No equation, definition, or self-citation is shown to reduce the stability conclusion to the axioms by construction, nor does any load-bearing step presuppose the target result. The derivation chain therefore remains self-contained against external verification of the axioms against the Farey graph itself.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The central claim rests on the existence of a first-order axiomatization that exactly describes the Farey graph and on the applicability of standard stability-theoretic machinery to that axiomatization.

axioms (1)
  • domain assumption The Farey graph admits a first-order axiomatization whose models are exactly the structures elementarily equivalent to the Farey graph.
    The paper's main claim begins with the assertion that such an axiomatization exists and is complete.

pith-pipeline@v0.9.0 · 5533 in / 1006 out tokens · 36283 ms · 2026-05-23T01:06:37.627255+00:00 · methodology

discussion (0)

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