Searcharxiv⌕ Search

arXiv · 2611.08964

Joint Approximation and the Mixed-Prime Character Group

Abstract

For the integer metric defined by the square denominators of two distinct primes, we prove simultaneous approximation to zero in one prime metric and to any prescribed integer in the other. A normalized convolution argument gives a uniform central spectral bound. Random relative translations of smooth weights produce an exact positive cas cade; Fourier positivity places every normalized finer convolution below its value at zero. A far-field recursion, the growth of merged square powers, and a two-term logarithmic-form estimate give summable fac tor bounds. Consequently, for every fixed pair of distinct primes p,q, the mixed continuous character group is Z[1/(pq)]/Z: no irrational pa rameter is continuous. The mixed completion is the product of the one-prime completions. For each fixed pair this also gives a compati ble rational join and a strictly finer compatible join of the associated real TVG topologies, with the same prescribed real character group. Exact witness search terminates at every strict precision and integer target. We retain the structural, density, divisibility, sequence and finite-certificate results leading to this proof. The existence argument does not give practical witness-size or runtime bounds, and it does not assume independence or equidistribution of the two digit systems. Se lected abstract components have been checked using Lean and Mathlib; the complete analytic argument has not been formalized. The corre sponding problem for three or more primes remains separate.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Irina Yaroshevskaya. 2026-11-06. Joint Approximation and the Mixed-Prime Character Group. https://arxiv.org/abs/2611.08964

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

KEEP EXPLORING

Related papers

Qin's Algorithm, Continued Fractions and 2-dimensional Lattices

In his ``Mathematical Treatise in Nine Sections''(1247), Jiushao Qin introduced ``the Dayan method of deriving unity'' for computing modular inverses, an essential component of his treatment of the Chinese remainder theorem. A distinctive feature of Qin's algorithm is its use of a state consisting of four nonnegative integers arranged in a matrix. In this paper, we investigate the mathematical structure of these states and their connections with continued fractions and two-dimensional lattices. By introducing a signed version of the state, we obtain a natural matrix representation that reveals the convergents of continued fractions and gives direct derivations of several classical results. We then show that the signed states form bases of a family of two-dimensional lattices arising from modular congruences. In particular, we prove that a shortest lattice vector can be obtained from the rows of a signed state or their sum or difference. We also study the monotonicity of the inner products of the state vectors and discuss a subsequent result that locates a shortest vector in one of two consecutive states. It is surprising that a shortest lattice vector is found in a highly structure sequence of states. These results demonstrate that the state structure of Qin's algorithm provides a unified framework for understanding modular inversion, continued fractions, and shortest vectors in two-dimensional lattices.

math.NT↗

The symmetrized sum of finite $q$-multiple harmonic sums with one exceptional index

In this paper, we give explicit expressions for $q$-harmonic sums on $1-\cdots-1,A,1-\cdots-1$ indices. The case $A=1$ has been extensively studied, and a variety of identities, explicit evaluations, and structural properties are known. Likewise, numerous explicit evaluations are available for $q$-multiple zeta values and $q$-harmonic sums with uniform indices $A-\cdots-A$. Although several methods are available for treating non-uniform indices, explicit evaluations for the pattern $1-\cdots-1,A,1-\cdots-1$ remain comparatively scarce. The case $A=2$ was settled only recently. In this paper, we extend this framework to the general case $A\ge3$ as the total sum with the theory of the elementary symmetric functions, though we do not generally evaluate each summand at a prescribed position of $A$. We obtain explicit formulas in terms of binomial coefficients and degenerate Bernoulli numbers. Some expressions about $2-\cdots-2,A,2-\cdots-2$ are also shown.

math.NT↗