Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated


Source. “Main Theorem on the Equivalence,” PDF p. 2 of the author survey. The survey identifies it as Theorem 4 of Sun's 1989 paper Systems of congruences with multipliers.

Conventions

Two weighted systems

A={(λs,as,ns)}s=1k,B={(μt,bt,mt)}t=1ℓA=\{(\lambda_s,a_s,n_s)\}_{s=1}^k, \qquad B=\{(\mu_t,b_t,m_t)\}_{t=1}^{\ell}

are equivalent, written A∼BA\sim B, when their covering maps agree. Let PP be a set of primes, let MM be a left RR-module, and let FF map into MM. Assume that whenever p∈Pp\in P, (x,y)∈Dom⁡(F)(x,y)\in\operatorname{Dom}(F), and r∈R(p)={0,…,p−1}r\in R(p)=\{0,\ldots,p-1\}, one has

(x+rp,py)∈Dom⁡(F).\left(\frac{x+r}{p},py\right)\in\operatorname{Dom}(F).

Statement

The following two conditions are equivalent.

  1. Whenever A∼BA\sim B, all weights lie in RR, and every prime divisor of every modulus belongs to PP, one has
∑s=1kλsF(x+asns,nsy)=∑t=1ℓμtF(x+btmt,mty)\sum_{s=1}^k\lambda_s F\left(\frac{x+a_s}{n_s},n_sy\right) = \sum_{t=1}^{\ell}\mu_t F\left(\frac{x+b_t}{m_t},m_ty\right)

for every (x,y)∈Dom⁡(F)(x,y)\in\operatorname{Dom}(F).

  1. For every p∈Pp\in P and (x,y)∈Dom⁡(F)(x,y)\in\operatorname{Dom}(F),
∑r=0p−1F(x+rp,py)=F(x,y).\sum_{r=0}^{p-1}F\left(\frac{x+r}{p},py\right)=F(x,y).

The survey prints a lowercase ff in the theorem's opening phrase and uses FF throughout the hypotheses and formulas; this transcription uses FF consistently.

Proof scope. The survey says this follows by induction from the Generating Theorem. The original 1989 proof was not acquired or independently checked here.