2024-06-23

642: Least Common Multiples of Subset of Commutative Ring

<The previous article in this series | The table of contents of this series | The next article in this series>

definition of least common multiples of subset of commutative ring

Topics


About: ring

The table of contents of this article


Starting Context



Target Context


  • The reader will have a definition of least common multiples of subset of commutative ring.

Orientation


There is a list of definitions discussed so far in this site.

There is a list of propositions discussed so far in this site.


Main Body


1: Structured Description


Here is the rules of Structured Description.

Entities:
R: { the rings }
S: R
S: ={mR|pS(qR(m=qp))}
lcm(S): ={mS|mS(qR(m=qm))}
//

Conditions:
//

S is called "set of common multiples of S".


2: Natural Language Description


For any ring, R, any subset of R, S, and the set of the common multiples of S, S:={mR|pS(qR(m=qp))}, lcm(S):={mS|mS(qR(m=qm))}


3: Note


This definition does not require R to have any order: "least" is not according to any order.

S= is not excluded, although it is not particularly assumed to be useful.

When S=, vacuously, S=R, and 1lcm(S), because d=d1 for each dS; if 0lcm(S), lcm(S)={0}, because d=q0=0, which does not contradict 1lcm(S), because that means that 1=0, which means that R={0=1}; what others lcm(S) has depends on R: when d is a unit, d=dd1d, so, dlcm(S); but otherwise, whether there is a qR such that d=qd for each dR is not clear.

Hereafter, let us suppose that S.

Always 0S: 0=0p for each pS.

But when 0lcm(S), lcm(S)={0}: m=0=q0 for each mS, so, S={0}.

When S is finite, pjSpjS: pkS(pjSpj=(pjS{pk}pj)pk).

lcm(S) may be empty or have multiple elements.

If 0S, S={0}: 0=q0 for each qR. The reverse is not necessarily true: as a counterexample, let R=Z/(6Z) and S={[2],[3]}, then, S={[0]}: the multiples of [2] are [20]=[0],[21]=[2],[22]=[4],[23]=[6]=[0],[24]=[8]=[2],[25]=[10]=[4] and the multiples of [3] are [30]=[0],[31]=[3],[32]=[6]=[0],[33]=[9]=[3],[34]=[12]=[0],[35]=[15]=[3].

If and only if S={0}, lcm(S)={0}: if S={0}, 0=00, so, 0lcm(S), while lcm(S) is a subset of S; if lcm(S)={0}, {0}S, but as 0=q0 for each qR, only 0 can be in S.

This definition does not exactly specialize to 'least common multiple of subset of integers': the least common multiples of {2,3} of Z by this definition are {6,6} (6=(3)2; 6=(2)3; 6=(1)(6)), while the least common multiple of {2,3} by 'least common multiple of subset of integers' is 6.


References


<The previous article in this series | The table of contents of this series | The next article in this series>