I have sometimes seen notations like $a\equiv b\pmod c$. How do we define the notation? Have I understood correctly that $c$ must be an element of some ring or does the notation work in magmas in general?
Asked
Active
Viewed 1,749 times
5
-
Long story short, $a\equiv b\pmod c$ is an abbreviating of $c|b-a$ which in turn is an abbreviation of $\exists k\in \mathbb Z\left(ck=b-a\right)$. – Git Gud May 30 '14 at 22:11
-
1Or if not invertible: $a=b+kc$ – C-star-W-star May 30 '14 at 22:33
-
https://en.wikipedia.org/wiki/Modular_arithmetic – miracle173 Dec 22 '21 at 14:24
2 Answers
4
In a commutative ring $\,R,\, $ $\, a\equiv b\pmod c\,$ means $\,c\mid a-b,\ $ i.e. $\,a-b = cr\,$ for some $\,r \in R,\,$ i.e. $\,a-b\in cR.\,$ More generally, $\,a\equiv b\pmod{ c_1,\ldots, c_n}\,$ means that $\,a-b\in (c_1,\ldots c_n)R := c_1 R+\cdots+ c_n R,\,$ the sum of the principal ideals $\,c_i R,\,$ i.e $\,a-b = c_1 r_1 + \cdots + c_n r_n\,$ for some $\,r_i\in R.\,$ If $\,S\subset R\,$ then $\,a\equiv b\pmod{\! S}$ means $\,a-b\in SR\,$ where $\,SR\,$ is the ideal generated by $S$ in $R$.
Congruence arithmetic provides an "element-ary" way of working in quotient (residue) rings. See here for the general correspondence between congruences, ideals, & $R$-subalgebras of a square $R^2$.
Similarly for groups (and ideal-determined algebras) we can normalize all equations $\,a = b\,$ to the form $\,a\!-\!b = \color{#c00}0,\,$ so a congruence is determined by a $\rm\color{#c00}{single}$ congruence class: all elements $\color{#c00}{\equiv 0}$ (as above for ideals in rings). In more general types of algebras we need to work directly with congruence (equivalence) relation operations.
As for magmas, or any other algebraic structure defined by purely equational axioms, the notion of ring-congruence generalizes in a straightforward way to that of an equivalence relation that is compatible with all of the operations of the structure, e.g. $\, A\equiv a,\ B\equiv b\,\Rightarrow\, A\oplus B = a\oplus b\,$ for all binary operations $\,\oplus\,$ of the algebra, and similarly for all other $\,n$-ary operations of the structure. Just as for rings, there is a quotient algebra that reifies the (modular) congruence arithmetic within an algebraic structure of the same type, just like even/odd parity arthmetic of integers mod $\,2\,$ is ring-theoretically reified as arithmetic in the quotient/residue ring $\,\Bbb Z/2.$
Bill Dubuque
- 272,048
-
Can you give a simple example? If I need to find an exponent $m$ that fits $a^m=1 (mod 7)$ what would $a^m$ be if it was not mod 7? My understanding is that one is the remainder of quotient of $a^m$ and 7. – Burt Feb 18 '21 at 22:26
-
1@Burt See here and here (and their linked posts) for many methods and examples. – Bill Dubuque Feb 18 '21 at 22:31
-
Thank you. Based on what I was reading, 13=1 (mod 2). Is this true? Would any number equal 1(mod 2)? – Burt Feb 18 '21 at 22:38
-
1@Burt $,a\equiv b\pmod{! 2},$ means $2$ divides $a-b,,$ or, equivalently, $a$ and $b$ have equal parity, i.e. both are even, i.e. $,a,b\equiv 0\pmod{! 2},,$ or both are odd $,a,b\equiv 1\pmod{! 2};,$ i.e. both leave the same remainder when divided by $2.,$ If you have further questions on such then please pose them either as as a math.SE question, or a question in a comment on an answer which specifically addresses this topic (this post does not). Any textbook on elementary number theory will have an introduction to congruences and modular arithmetic – Bill Dubuque Feb 19 '21 at 00:28
0
You certainly need a ring since a magma has only one binary operation while the modulus expression involves two: $$a\equiv b\pmod{c}:\iff a=b+k\cdot c$$
C-star-W-star
- 16,275