Connected components in d-minimal structures

Masato Fujita

arxiv: 2506.21846 · v3 · submitted 2025-06-27 · 🧮 math.LO

Connected components in d-minimal structures

Masato Fujita This is my paper

Pith reviewed 2026-05-19 08:35 UTC · model grok-4.3

classification 🧮 math.LO

keywords d-minimal structuresconnected componentsdefinable setsmodel theoryo-minimalityreal ordered fieldordered groups

0 comments

The pith

Adding unions of connected components from definable sets to a d-minimal expansion of the reals produces another d-minimal structure.

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

The paper establishes that starting from a d-minimal expansion of the ordered real field, one can form a new expansion by adjoining all sets that arise as unions of selected connected components of already definable sets, and this new expansion remains d-minimal. The same preservation result applies when the starting point is an almost o-minimal expansion of an ordered group. A sympathetic reader cares because d-minimality supplies a form of tameness that limits the complexity of definable sets in one dimension at a time, so closure under this operation yields a larger but still controlled collection of definable sets. The construction therefore gives a systematic way to enlarge the definable universe while keeping the structural restrictions that make these expansions useful for geometric and model-theoretic questions.

Core claim

For any d-minimal expansion R of the ordered real field, let R^natural be the expansion generated by adding every set of the form union of a subfamily of the connected components of an R-definable set. The paper proves that R^natural is again d-minimal. An analogous statement holds when R is an almost o-minimal expansion of an ordered group.

What carries the argument

The expansion R^natural obtained by adjoining all possible unions of connected components of definable sets from the base structure.

If this is right

The collection of d-minimal expansions is closed under this particular adjoining operation.
Definable connectedness can be studied inside the enlarged structure without leaving the class of d-minimal structures.
The result extends directly to almost o-minimal expansions of ordered groups.
Repeated applications of the construction still yield d-minimal structures.

Where Pith is reading between the lines

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

The operation may serve as a step toward describing the smallest d-minimal structure containing a given collection of sets.
One could test whether the same closure property holds for other tameness notions such as weak o-minimality.
The construction suggests examining how dimension and connectedness interact inside these enlarged structures.

Load-bearing premise

The base structure must already be d-minimal as an expansion of the ordered real field, or almost o-minimal as an expansion of an ordered group.

What would settle it

An explicit d-minimal expansion R together with one concrete union of connected components such that the resulting expansion violates d-minimality, for example by producing a definable subset of the line whose connected components cannot be controlled in the required way.

read the original abstract

For a given d-minimal expansion $\mathfrak R$ of the ordered real field, we consider the expansion $\mathfrak R^\natural$ of $\mathfrak R$ generated by the sets of the form $\bigcup_{S \in \mathcal C}S$, where $\mathcal C$ is a subfamily of the collection of connected components of an $\mathfrak R$-definable set. We prove that $\mathfrak R^{\natural}$ is d-minimal. A similar assertion holds for almost o-minimal expansions of ordered groups.

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.

Desk Editor's Note private letter to a colleague

This paper proves that adding unions of connected components preserves d-minimality in the relevant expansions, with a direct reduction that holds up.

read the letter

The main point is that expanding a d-minimal structure by adding predicates for all possible unions of connected components keeps the structure d-minimal. A similar preservation holds for almost o-minimal expansions of ordered groups. This is the central claim and the paper delivers it through a reduction to the original properties. The new contribution is checking this specific closure operation. The proof shows that definability questions in the expanded language reduce to facts already controlled by d-minimality, using cell decomposition and component finiteness arguments that carry over directly. The lemmas apply uniformly to the new predicates without extra assumptions or circular steps. This approach is straightforward and keeps the argument clean. The soft spots are minor and expected for this kind of result. The work stays narrow, adding one targeted way to enlarge these structures but not introducing broader methods or resolving open questions outside the preservation itself. It works within the standard tools for d-minimal and almost o-minimal settings. No load-bearing gaps appear in the reduction. This paper is for researchers already working on tame expansions of ordered fields and groups. A reader in that subfield gets a useful technical lemma for building larger examples while keeping the tameness. It is not aimed at or necessary for wider model theory audiences. I would bring this to a reading group focused on o-minimality or tame geometry. It deserves peer review because the central claim is substantiated with no evident flaws in the logic.

Referee Report

0 major / 3 minor

Summary. The manuscript establishes a preservation result for d-minimality: if R is a d-minimal expansion of the ordered real field, then the expansion R^natural obtained by adjoining predicates for arbitrary unions of connected components of R-definable sets is again d-minimal. An analogous statement is proved for almost o-minimal expansions of ordered groups. The argument proceeds by showing that definability in the expanded language reduces to properties already controlled by the original d-minimality assumption, using cell decomposition and uniform finiteness of connected components.

Significance. If the result holds, it demonstrates that d-minimality is stable under a natural topological closure operation on definable sets. This strengthens the toolkit for studying generalized o-minimal structures, particularly in contexts where connected components play a role in definable topology or cell decomposition. The direct carry-over of component-counting lemmas from the base structure is a clear technical strength.

minor comments (3)

§2: The definition of R^natural is introduced via a generated expansion, but the precise language and the arity of the new predicates are not stated explicitly; a short paragraph clarifying the signature would improve readability.
§4, Lemma 3.2: The reference to 'uniform finiteness' of components is used without recalling the exact statement from the base theory; adding a one-sentence reminder would help readers who are not experts in d-minimality.
The abstract claims the result for both d-minimal and almost o-minimal cases, yet the introduction focuses almost exclusively on the ordered-field setting; a brief sentence indicating where the group case diverges would be useful.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive summary, significance assessment, and recommendation of minor revision. No specific major comments were listed in the report, so we have no individual points requiring detailed rebuttal. We will incorporate minor improvements to presentation and clarity in the revised version.

Circularity Check

0 steps flagged

No significant circularity in the preservation result

full rationale

The paper establishes a preservation theorem: if R is d-minimal (or almost o-minimal), then the expansion R^natural generated by adding all possible unions of connected components of R-definable sets remains d-minimal. The argument proceeds by showing that definability in the expanded structure reduces directly to the original d-minimality via cell decomposition and finiteness of connected components, which carry over uniformly without introducing new assumptions or fitted quantities. No self-definitional reductions, load-bearing self-citations, or renamings of known results appear; the derivation is self-contained against the standard definition of d-minimality and external model-theoretic tools.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The argument rests on the standard definition of d-minimality and the ordered-field axioms; no free parameters or new entities are introduced in the abstract.

axioms (1)

domain assumption R is a d-minimal expansion of the ordered real field
Explicitly stated as the starting point of the construction.

pith-pipeline@v0.9.0 · 5593 in / 967 out tokens · 54419 ms · 2026-05-19T08:35:40.149535+00:00 · methodology

Connected components in d-minimal structures

Core claim

What carries the argument

If this is right

Where Pith is reading between the lines

Load-bearing premise

What would settle it

discussion (0)