REVIEW 3 major objections 2 minor
Integer continued fractions for complex numbers
T0 review · 3 major / 2 minor · reviewed 2026-08-05 · deepseek-v4-flash
Pith's one-line read A unique integer continued fraction expansion exists for every complex number.
desk verdict A promising extension of continued fractions to complex numbers, but the abstract leaves the load-bearing rounding rule unstated; deserves refereeing. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The central object is the complex continued-fraction algorithm: at each step choose a Gaussian integer nearest to the current complex value, subtract it, and invert the fractional part. This 'subtract, invert, repeat' process generates the expansion, and the specific rule for choosing the nearest Gaussian integer is what makes the representation unique and links it to cutting sequences.
What would settle it
Take a complex number such as (1+i)/2, whose nearest Gaussian integers are tied. Run the algorithm under the paper's stated tie-breaking rule and under an alternative tie-breaking rule. If the resulting expansions have different limits, or if the convergents do not converge to the starting number, then the claims of convergence or uniqueness fail.
Extended reading notes
Core claim
The paper establishes that the complex continued fraction algorithm produces a unique expansion for each complex number: starting with z, take the nearest Gaussian integer a0, subtract it, and invert the remainder; repeat on the result to get a0 + 1/(a1 + 1/(a2 + ...)). The infinite sequence of Gaussian integers is shown to converge back to z, and the representation is unique when the integer part is chosen by a fixed nearest-integer rule. The expansion's digits are also shown to form a cutting sequence—the sequence of horizontal and vertical grid lines crossed by a line through the Gaussian integer lattice—giving a geometric picture of the coefficients.
Load-bearing premise
The uniqueness and convergence of the expansion depend on a fixed rule for choosing which Gaussian integer counts as the integer part at each step; the abstract does not say what that rule is, and the whole theory rests on it.
Editorial extensions
If this is right
- Every complex number in the algorithm's domain is assigned one canonical expansion, so the representation can serve as a normal form for complex numbers.
- The convergence properties give a family of rational (Gaussian-rational) approximations to any complex number, with error controlled by the tail of the expansion.
- The cutting-sequence interpretation provides a visual and combinatorial model for the expansion digits, potentially connecting continued fractions to geometry of the grid.
- Because the algorithm is a straightforward iteration, the expansion is computable in practice, offering a concrete way to encode complex numbers.
- The uniqueness result suggests that the complex continued fraction shares structural features with the real case, such as a well-behaved Gauss map and approximation theory.
Reading between the lines
- If the expansion is unique and convergent, a natural next step is to characterize which complex numbers have terminating or eventually periodic expansions; by analogy with the real case, these should be precisely the Gaussian-rationals and certain quadratic irrationals in the complex plane.
- The cutting-sequence picture suggests a direct symbolic-dynamical interpretation: the digits may encode the orbit of a rotation or a billiard path on the flat torus, which could open a new connection between continued fractions and low-dimensional dynamics.
- The algorithm's dependence on a nearest-integer rule raises a testable question: whether changing the tie-breaking convention changes the expansion of some numbers, and whether the uniqueness claim survives all natural choices of the rule.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript, available only as an abstract, announces a natural extension of standard continued fractions to complex numbers. The basic algorithm is attributed to Lagrange and Gauss and is claimed to produce a unique integer continued fraction for each complex number in an unspecified domain, with useful convergence and approximation properties and a geometric cutting-sequence interpretation. Because no derivation, algorithm specification, or proof is provided, the central claims cannot be inspected from the submitted text.
Significance. If the claims are correct, the construction would provide a principled complex analogue of classical continued fractions, with uniqueness and a geometric interpretation that could be of interest in number theory and dynamical systems. The attribution to Lagrange and Gauss and the cutting-sequence connection are potentially valuable. However, as the submission contains no equations, algorithm pseudocode, or proofs, the significance cannot be weighed beyond the plausibility of the announced program.
major comments (3)
- [Abstract] The central assertion of a 'unique integer continued fraction for each complex number' is not well-defined in the abstract because no deterministic rule for selecting the complex 'integer part' is stated. On the Gaussian integer lattice, points with half-integer coordinates are equidistant from multiple Gaussian integers. Without a fixed tie-breaking convention, the map T(z)=1/(z-a(z)) is not a function, and the uniqueness claim for boundary points is undefined.
- [Abstract] The abstract claims 'useful properties' and convergence, but gives no argument. With the nearest-neighbor choice in Z[i], the remainder satisfies |z-a(z)| <= sqrt(2)/2, so after inversion the next term can have modulus as large as sqrt(2); this is not a contraction. Convergence would require a separate denominator-growth or geometric argument, and the abstract does not state that such an argument exists. This is load-bearing for the central claim that every complex number is represented.
- [Abstract] No domain for the representation is specified. The phrase 'for each complex number' presumably cannot hold for all of C including zero and negative real axes without caveats about the algorithm's failure points or the need for a different integer-part rule. The uniqueness claim also needs a precise equivalence convention for terminating vs. infinite continued fractions. These omissions prevent verification of the main theorem.
minor comments (2)
- [Abstract] The term 'integer continued fraction' should specify which ring of integers is used (presumably Gaussian integers Z[i]) and how rational/integer coefficients are defined. This is a clarity issue that will matter for the full paper.
- [General] The submission contains only the abstract; there are no section numbers, equations, references, or appendices to review. At minimum, the full manuscript should be made available for evaluation.
Circularity Check
No circularity identifiable from abstract-only review
full rationale
The paper's abstract asserts that a natural extension of standard continued fractions to complex numbers (algorithm attributed to Lagrange and Gauss) yields unique representations with useful properties and a geometric interpretation. No equations, proofs, or cited results are available in the abstract-only input, so there is no evidence that any claimed derivation reduces to its own inputs. In particular, the uniqueness claim cannot be shown to be self-definitional, and the convergence properties cannot be shown to be fitted from data. The absence of detail about the rounding rule or domain is a completeness concern, not a circularity concern. Per the hard rules, circularity may only be claimed when a specific reduction can be quoted and exhibited; no such reduction exists here. The appropriate verdict is no significant circularity (score 0), with the caveat that a full-text review could revisit this finding if it reveals that uniqueness is imposed by construction or that a fitted parameter is renamed as a prediction.
Assumptions & free parameters
assumptions (2)
- domain assumption The Lagrange-Gauss algorithm is well-defined for all complex numbers in the domain under consideration.
- domain assumption The chosen rounding rule for the integer part yields convergence of the continued fraction.
Cite this review
Pith. "Pith review of Integer continued fractions for complex numbers." pith.science (2026). https://pith.science/paper/VQOP2YVA
@misc{pith2026250815078,
author = {Pith},
title = {Pith review of: Integer continued fractions for complex numbers},
year = {2026},
howpublished = {\url{https://pith.science/paper/VQOP2YVA}},
note = {Machine review of arXiv:2508.15078}
}
read the original abstract
We study a natural extension to complex numbers of the standard continued fractions. The basic algorithm is due to Lagrange and Gauss, though it seems to have gone mostly unnoticed as a way to create continued fractions. The new representations are shown to be unique, and to have useful properties. They also admit a geometric cutting sequence interpretation.
Reviewed August 5, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.