Search arXivSearch

arXiv · 2609.13189

Canonical Expansions of $\mathbb R_{\mathcal Q}$-Germs

Abstract

Let $\mathcal{H}_{\mathcal{Q}}$ be the field of unary germs at $0^+$ definable in the quasianalytic o-minimal structure $\mathbb{R}_{\mathcal{Q}}$ of Kaiser-Rolin-Speissegger. We construct a canonical ordered differential-field embedding of $\mathcal{H}_{\mathcal{Q}}$ into the field of natural-support generalized Laurent series. Every unary germ has a unique such asymptotic expansion, and bounded germs have expansions with only nonnegative exponents. A germ admits a convergent generalized Laurent-series representation exactly when its canonical expansion converges; in that case, every convergent representation with well-ordered support is canonical. We also prove that $\mathbb{R}_{\mathcal{Q}}$ is branching in the sense of Dembner [1]. A nonresonant hyperbolic saddle with divergent Dulac series yields a bounded positive real-analytic $\mathbb{R}_{\mathcal{Q}}$-definable germ whose canonical generalized power series diverges. This gives a negative answer to a question of Dembner asking whether every unary germ definable in a branching structure admits a convergent generalized power-series representation. Nevertheless, every bounded unary $\mathbb{R}_{\mathcal{Q}}$-germ has a canonical formal generalized power-series expansion. Consequently, the convergent germs form a proper ordered differential subfield of $\mathcal{H}_{\mathcal{Q}}$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mostafa Mirabi. 2026-08-09. Canonical Expansions of $\mathbb R_{\mathcal Q}$-Germs. https://arxiv.org/abs/2609.13189

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Bluebirds and mockingbirds cannot produce a fixed-point combinator

Let $B$ be the bluebird combinator with reduction rule $Bxyz \to_{w} x\left(yz\right)$, let $M$ be the mockingbird combinator with reduction rule $Mx \to_{w} xx$, and let $I$ be the identity bird combinator with reduction rule $Ix \to_{w} x$. A fixed-point combinator, called a sage bird by Smullyan, is a closed term $Y$ such that, for a fresh variable $x$, $Yx$ is equivalent to $x\left(Yx\right)$ under these reduction rules. For a fixed variable $x$, we construct an invariant $\mathrm{Tr}_{x}\left(u\right)$ of a $BMI$-term $u$ with respect to $\to_{w}$. This invariant traces the occurrences of $x$ in the leftmost-innermost reduction sequence of $u$. We then prove that $\mathrm{Tr}_{x}\left(Yx\right) \neq \mathrm{Tr}_{x}\left(x^{r}\left( Yx \right)\right)$ for every $x$-free $BMI$-term $Y$ and every $r\geq 1$. Consequently, there exists no fixed-point combinator in $BMI$-combinatory logic. This provides a negative answer to the problem posed by Smullyan in 1985.

math.LO

Pointwise provable equality and the failure of composition

Montagna (1989) and Di Paola--Montagna (1991) claim that the algebraic systems $S'$ and $S'_T$, respectively, are categories. We show that the proposed composition is not independent of the choice of representatives. For every consistent recursively enumerable extension $T$ of Peano arithmetic ($\mathrm{PA}$), we exhibit two program indices that are pointwise provably equal in $T$ but yield inequivalent composites when each is run after the same program. Montagna's $S'$ is the case $T=\mathrm{PA}$. The failure already occurs for partial maps from $ω$ to itself. Weak totality and the proposed range assignment also depend on the choice of representatives. More generally, for consistent $T\supseteq\mathrm{PA}$, pointwise provable equality is a composition congruence exactly when $T$ proves every true $Π^0_1$ sentence, in which case it is extensional equality. This completeness condition fails for every consistent recursively enumerable $T\supseteq\mathrm{PA}$ by Gödel's second incompleteness theorem. For every extension $T\supseteq\mathrm{PA}$, the least composition congruence containing pointwise provable equality is extensional equality if $T$ is $Σ^0_1$-sound and the universal relation otherwise.

math.LO

Compactness via Consistency Properties

We will use consistency properties to characterize strongly compact cardinals, first showing an adequate Model Existence Theorem for larger fragments.

math.LO