1
$\begingroup$

Intuitive Idea: Say we have polynomials modulo positive integers; for instance, $f(x) = 3x + 1\pmod 5$ and $g(x) = 5x^2 - x + 3 \pmod 7$. (Yes, there is some abuse of notation here.) We may "compose" these functions with each other. For instance, $f(3) = 9 + 1 \equiv 0 \pmod 5$, and $g(0) \equiv 5\cdot0 - 0 + 3 \equiv 3 \pmod 7$. We may write this as $(gf)(3) = 3$. Some other outputs are $(gf)(1)=g(4)=2$, $(gf)(2)=g(7) \equiv g(0)=3\pmod 7$, and so on. The question is, is this composition function $(gf)(x)$ the same as some $p(x) \pmod m$, where $p$ is a polynomial and $m$ is a positive integer?

Formalization with maps: For any integer n, let $i_n : \mathbb{Z}_p \mapsto \mathbb{Z}$ be the inclusion and let $h_n : \mathbb{Z} \mapsto \mathbb{Z}/n\mathbb{Z} = \mathbb{Z}_n$ be the surjective group homomorphism (is there a special name for this map?). Let $p,q \in \mathbb{N}$. For all $f \in \mathbb{Z}_p[x]$ ,$g \in \mathbb{Z}_q[x]$, does there exist some $r \in \mathbb{N},h \in \mathbb{Z}_r[x]$ such that $r = h_r(i_qgh_q)(i_pfh_p)i_r$?

$\endgroup$
4
  • 1
    $\begingroup$ I should note that the sum of two linear functions modulo integers is not necessarily a linear function modulo an integer. I only know this because linearity is easier to check. $\endgroup$ Commented May 10 at 1:18
  • 2
    $\begingroup$ It's not well-defined, e.g. $\bmod 5\!:\ f(3)\equiv\color{#c00}0\equiv \color{#0a0}5,\,$ but $\!\!\mod 7\!:\ 3\equiv g(\color{#c00}0)\not\equiv g(\color{#0a0}5)\equiv 4\ \ $ $\endgroup$ Commented May 10 at 1:43
  • $\begingroup$ The special name you are looking for is the "quotient map". $\endgroup$
    – user1318062
    Commented May 10 at 1:59
  • $\begingroup$ With the potential confusion on the codomains of $f$ and $g$, can you clarify whether $0$ is in the codomains? Or are $5$ and $7$ in the codomains $\mathbb Z_5$ and $\mathbb Z_7$ respectively? $\endgroup$
    – peterwhy
    Commented May 10 at 3:34

0

You must log in to answer this question.