[Paper Review] Universality of Univariate Mixed Fractions in Divisive Meadows

J.A. Bergstra, Inge Bethke+1 more|arXiv (Cornell University)|Jul 3, 2017

Meromorphic and Entire Functions3 citations

TL;DR

This paper establishes that all univariate fractions in divisive meadows of characteristic zero can be rewritten as mixed fractions—combinations of a polynomial and a simple fraction—providing a universal normal form. The key result is that this transformation is always possible in the rational and complex number meadows, with applications to decidability of finite support summation in complex meadows.

ABSTRACT

Univariate fractions can be transformed to mixed fractions in the equational theory of meadows of characteristic zero.

Motivation & Objective

• To investigate whether univariate fractions in divisive meadows can be rewritten into mixed fractions, i.e., sums of polynomials and simple fractions.
• To determine whether such a transformation is universally possible in the meadow of rational numbers and in the meadow of complex numbers.
• To explore the proof-theoretic consequences of this normal form for equational theories of meadows.
• To apply the result to decidability of finite support summation in the complex meadow.

Proposed method

• Uses algebraic manipulation and polynomial division to rewrite univariate fractions into mixed forms, leveraging the structure of rational functions.
• Employs the identity $ \varphi_A(x) = 1 - \frac{\prod_{a \in A}(x - a)}{\prod_{a \in A}(x - a)} $ to construct characteristic functions that isolate roots and enable decomposition.
• Applies the equational theory of divisive meadows, including axioms for division and inverses, to prove provable equalities between terms.
• Reduces the decidability of finite support summation to the solvability of systems of polynomial equations and inequalities over complex numbers.
• Uses Tarski’s decidability result for real closed fields to establish decidability of the summation predicate.
• Demonstrates that any univariate term $ t $ is provably equal to $ g + f $, where $ g $ is a polynomial and $ f $ is a simple fraction, using the axiom set $ \mathcal{E}_{\mathrm{Md}}^{\mathrm{d}} \cup \{\underline{n}/\underline{n} = 1\} $.

Experimental results

Research questions

• RQ1 Can every univariate fraction in a divisive meadow of characteristic zero be expressed as a mixed fraction?
• RQ2 Is the meadow of complex numbers closed under the transformation of univariate fractions into mixed forms?
• RQ3 What is the equational proof-theoretic consequence of this normal form for the theory of divisive meadows?
• RQ4 Is the finite support summation $ \sum^{*}_{x} t(x) = 1 $ decidable in the complex meadow?
• RQ5 To what extent can the univariate result be generalized to multivariate rational functions?

Key findings

• All univariate fractions over the meadow of rational numbers can be rewritten as mixed fractions, proving the universality of mixed fractions in $ \mathbb{Q}_0^d $ (Theorem 3.1).
• The same universality holds in the meadow of complex numbers, establishing that every univariate term is provably equal to a sum of a polynomial and a simple fraction (Theorem 4.1).
• The equational theory of divisive meadows of characteristic zero admits a normal form: every univariate term $ t $ is provably equal to $ g + f $, where $ g $ is a polynomial and $ f $ is a simple fraction (Theorem 4.2).
• Finite support summation $ \sum^{*}_{x} t(x) = 1 $ is decidable in $ \mathbb{C}_0^d $, as it reduces to checking whether a finite set of roots of the denominator supports a nonzero sum (Theorem 4.3).
• The decidability result relies on Tarski’s theorem on the decidability of the first-order theory of real closed fields, applied to the system of equations and inequalities characterizing the support of $ t $.
• The result shows that the structure of univariate rational functions in divisive meadows allows for effective normal forms and decision procedures, even though the multivariate case remains open.