Search arXivSearch

arXiv · 2606.01497

Rosenbrock's Theorem characterizes Prüfer domains

Abstract

Under coprimality assumptions on certain submatrices, Rosenbrock's Theorem relates the Smith form of a matrix $P$ over an elementary divisor domain $\mathcal{R}$ to the Smith-McMillan form of a matrix $G$ over the field of fractions of $\mathcal{R}$, where $G$ is a Schur complement in $P$. If $\mathcal{R}$ is not an elementary divisor domain, Rosenbrock's Theorem is not directly applicable in its original form, because not every matrix is unimodularly equivalent to a matrix in Smith form. In this paper, we state an ideal-theoretic version of Rosenbrock's Theorem that is meaningful over any integral domain, and we show that it is equivalent to the classic formulation over an elementary divisor domain. Moreover, we give a characterization of Prüfer domains as those integral domains over which the ideal-theoretic version of Rosenbrock's Theorem holds for every matrix satisfying the assumptions. In particular, the theorem does not hold for every admissible matrix over $\mathbb{C}[x_1,\dots,x_d]$ when $d \geq 2$. However, when $d\leq 3$, it holds for square matrices in a nonempty Zariski-open subset of the coefficient space, having fixed the block sizes and a total degree bound. Finally, we prove that, if $\mathcal{R}$ is an integral domain such that every right invertible matrix can be completed to a unimodular matrix, then every matrix $P$ that satisfies the assumptions of the ideal-theoretic Rosenbrock's Theorem and realizes the same Schur complement $G$ shares the same ideal-theoretic generalization of the Smith form.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Vanni Noferini. 2026-09-11. Rosenbrock's Theorem characterizes Prüfer domains. https://arxiv.org/abs/2606.01497

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

KEEP EXPLORING

Related papers

On triviality of $\mathbb{A}^2$-forms admitting a nontrivial $\mathbb{G}_a$-action

T. Kambayashi had shown that $\mathbb{A}^2$-forms over separable field extensions are necessarily polynomial rings. However, there exist inseparable $\mathbb{A}^2$-forms which are not necessarily polynomial rings. In this paper, we give a structure theorem for $\mathbb{A}^2$-forms over arbitrary field extensions admitting a nontrivial $\mathbb{G}_a$-action. From this structure theorem we derive some conditions under which an $\mathbb{A}^2$-form becomes trivial. In particular, we prove that over a field $k$, a factorial $\mathbb{A}^2$-form having a $k$-rational point and a non-trivial $\mathbb{G}_a$-action is trivial and we also give examples demonstrating that none of these hypotheses can be discarded. As a consequence of the structure theorem, we obtain a generalization of the Zariski Cancellation Theorem for the affine plane over an arbitrary field.

math.AC

Symbolic powers of the ideal of$n$ general points in $P^{n-1}$

Problem L of Fröberg--Lundqvist--Oneto--Shapiro asks for the difference between the Hilbert series of ordinary and symbolic powers of the ideal of general points in projective space. We solve this completely for \(n\) general points of \(\PP^{n-1}\). Besides a closed formula for \[ \HS(S/I^m)-\HS(S/I^{(m)}), \] we determine all minimal monomial generators of \(I^{(m)}\), and describe the symbolic Rees algebra. We also show that containment \(I^{(m)}\subseteq I^r\) is detected solely by initial degrees. This gives the exact containment threshold, the Waldschmidt constant \(\walpha\), the resurgence \(\Res\), and the asymptotic resurgence \(\aRes\): \[ \walpha(I)=\frac{n}{n-1}, \qquad \Res(I)=\aRes(I)=\frac{2(n-1)}{n}. \] We also take the first step beyond \(n\) points: for \(n+1\) general points of \(\PP^{n-1}\) --- again a rigid, non-monomial configuration --- we identify the defining quadrics, resolve the case \(n=3\) completely (a complete intersection, with \(J^{(m)}=J^m\) for all \(m\) and resurgence \(1\)), and propose an exact Waldschmidt-constant formula \(\walpha=\frac{n+1}{n-1}\) for all \(n\), verified computationally in every case we could check.

math.AC